Author image not provided
 Ron Adany

Authors:
Add personal information
  Affiliation history
Bibliometrics: publication history
Average citations per article0.50
Citation Count3
Publication count6
Publication years2009-2016
Available for download3
Average downloads per article105.67
Downloads (cumulative)317
Downloads (12 Months)54
Downloads (6 Weeks)6
SEARCH
ROLE
Arrow RightAuthor only


AUTHOR'S COLLEAGUES
See all colleagues of this author

SUBJECT AREAS
See all subject areas




BOOKMARK & SHARE


6 results found Export Results: bibtexendnoteacmrefcsv

Result 1 – 6 of 6
Sort by:

1 published by ACM
April 2016 ACM Transactions on Algorithms (TALG): Volume 12 Issue 3, June 2016
Publisher: ACM
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 6,   Downloads (12 Months): 49,   Downloads (Overall): 108

Full text available: PDFPDF
We study a variant of the generalized assignment problem ( gap ), which we label all-or-nothing gap ( agap ). We are given a set of items, partitioned into n groups, and a set of m bins. Each item ℓ has size s ℓ > 0, and utility a ℓ ...
Keywords: group packing, ad placement, Generalized assignment problem, approximation algorithms

2
March 2014 Applied Artificial Intelligence - Recent Advances in Applied Computational Intelligence: Volume 28 Issue 3, 2014
Publisher: Taylor & Francis, Inc.
Bibliometrics:
Citation Count: 0


3
March 2013 IPCO'13: Proceedings of the 16th international conference on Integer Programming and Combinatorial Optimization
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 0

We study a variant of the generalized assignment problem (gap) which we label all-or-nothing GAP ( AGAP ) . We are given a set of items, partitioned into n groups, and a set of m bins. Each item ℓ has size s ℓ >0, and utility a ℓ j ≥0 ...

4
March 2013 Multimedia Systems: Volume 19 Issue 2, March 2013
Publisher: Springer-Verlag New York, Inc.
Bibliometrics:
Citation Count: 2

In this paper we consider the problem of allocating personal TV advertisements to viewers. The problem's input consists of ad requests and viewers. Each ad is associated with a length, a payment, a requested number of viewers, a requested number of allocations per viewer and a target population profile. Each ...
Keywords: Heuristics, Uncertainty, Personalization, TV advertisements, Allocation

5 published by ACM
November 2010 MoMM '10: Proceedings of the 8th International Conference on Advances in Mobile Computing and Multimedia
Publisher: ACM
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 0,   Downloads (12 Months): 3,   Downloads (Overall): 114

Full text available: PDFPDF
In this paper we consider the problem of allocating personal TV advertisements when the viewers' viewing capacities are uncertain. We focus on the Mobile TV medium as a personal platform taking into account special constraints that are motivated by the TV medium. Since the problem is NP-Hard, we present a ...

6 published by ACM
December 2009 MoMM '09: Proceedings of the 7th International Conference on Advances in Mobile Computing and Multimedia
Publisher: ACM
Bibliometrics:
Citation Count: 1
Downloads (6 Weeks): 0,   Downloads (12 Months): 2,   Downloads (Overall): 95

Full text available: PdfPdf
Personal advertisements are the next-generation in the world of advertisement. In this article we consider the personal advertisement allocation problem with constraints that are motivated by the TV and Mobile advertisement worlds. This problem is a version of the Generalized Multi-Assignment Problem, defined as an extension of GAP with assignment ...



The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2018 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us