5995 search results - page 217 / 1199 » Algorithmic Game Theory |
177
click to vote
GIAE
2004
Springer
15 years 9 months ago
2004
Springer
This paper surveys the new, algorithmic theory of moving frames developed by the author and M. Fels. Applications in geometry, computer vision, classical invariant theory, the cal...
123
click to vote
COCO
2005
Springer
15 years 9 months ago
2005
Springer
We show that the Multicut, Sparsest-Cut, and Min-2CNF≡ Deletion problems are NP-hard to approximate within every constant factor, assuming the Unique Games Conjecture of Khot [S...
110
click to vote
IE
2007
15 years 5 months ago
2007
The ludic experience of exploring wilderness in gameworlds may be compromised by either the negative affects of disorientation or the conspicuous application of architectural prin...
159
click to vote
JUCS
2008
15 years 4 months ago
2008
Abstract: Nowadays, in the markets of broadband access services, traditional contracts are of "static" type. Customers buy the right to use a specific amount of resources...
195
click to vote
CP
2004
Springer
15 years 9 months ago
2004
Springer
The success of stochastic algorithms is often due to their ability to effectively amplify the performance of search heuristics. This is certainly the case with stochastic sampling ...