2957 search results - page 429 / 592 » The Complexity of Polynomial-Time Approximation |
137
click to vote
ATAL
2007
Springer
16 years 11 days ago
2007
Springer
This paper proposes a new variant of the task allocation problem, where the agents are connected in a social network and tasks arrive at the agents distributed over the network. W...
164
click to vote
CPAIOR
2007
Springer
16 years 10 days ago
2007
Springer
We study the complexity of combinatorial problems that consist of competing infeasibility and optimization components. In particular, we investigate the complexity of the connectio...
158
click to vote
ECML
2007
Springer
16 years 10 days ago
2007
Springer
When facing the question of learning languages in realistic settings, one has to tackle several problems that do not admit simple solutions. On the one hand, languages are usually...
126
click to vote
EUROCAST
2007
Springer
16 years 10 days ago
2007
Springer
After the detection of the first extrasolar planet (exoplanet) more than one decade ago we currently know about more than 200 planets around other stars and there are about twenty...
179
click to vote
WINE
2007
Springer
16 years 8 days ago
2007
Springer
Internet search companies sell advertisement slots based on users’ search queries via an auction. Advertisers have to solve a complex optimization problem of how to place bids o...