1662 search results - page 126 / 333 » The Computational Complexity of Agent Design Problems |
131
Voted
ATAL
2010
Springer
15 years 4 months ago
2010
Springer
In the course allocation problem, a university administrator seeks to efficiently and fairly allocate schedules of over-demanded courses to students with heterogeneous preferences...
121
click to vote
EUROPAR
2009
Springer
15 years 10 months ago
2009
Springer
The transition to multicore architectures has dramatically underscored the necessity for parallelism in software. In particular, while new gaming consoles are by and large multicor...
134
Voted
AAAI
2000
15 years 5 months ago
2000
Scheduling, routing, and layout tasks are examples of hard operations-research problems that have broad application in industry. Typical algorithms for these problems combine some...
239
Voted
ICDE
2002
IEEE
16 years 5 months ago
2002
IEEE
Nearest Neighbor search is an important and widely used problem in a number of important application domains. In many of these domains, the dimensionality of the data representati...
151
click to vote
FOCS
2008
IEEE
15 years 10 months ago
2008
IEEE
The central problem in computational mechanism design is the tension between incentive compatibility and computational ef ciency. We establish the rst significant approximability ...