154 search results - page 7 / 31 » Approximated Consistency for Knapsack Constraints |
SIGECOM
2010
ACM
14 years 8 days ago
2010
ACM
We study the design of truthful mechanisms that do not use payments for the generalized assignment problem (GAP) and its variants. An instance of the GAP consists of a bipartite g...
ICALP
2003
Springer
14 years 20 days ago
2003
Springer
We consider requests for capacity in a given tree network T = (V, E) where each edge of the tree has some integer capacity ue. Each request consists of an integer demand df and a ...
CORR
2010
Springer
13 years 6 months ago
2010
Springer
We analyze judgement aggregation problems in which a group of agents independently votes on a set of complex propositions that has some interdependency constraint between them (e....
EVOW
2007
Springer
13 years 11 months ago
2007
Springer
In this paper we introduce an hybrid evolutionary algorithm for computer-aided orchestration. Our current approach to orchestration consists in replicating a target sound with a se...
GRID
2006
Springer
13 years 7 months ago
2006
Springer
Grid computing involves the transparent sharing of computational resources of many types by users across large geographic distances. The altruistic nature of many current grid reso...