5995 search results - page 424 / 1199 » Algorithmic Game Theory |
210
click to vote
ICML
2003
IEEE
16 years 8 months ago
2003
IEEE
We investigate methods for planning in a Markov Decision Process where the cost function is chosen by an adversary after we fix our policy. As a running example, we consider a rob...
222
click to vote
ESA
2008
Springer
15 years 9 months ago
2008
Springer
Path planning is a central problem in virtual environments and games. When computer-controlled characters move around in virtual worlds they have to plan their paths to desired loc...
191
click to vote
CVPR
2003
IEEE
16 years 9 months ago
2003
IEEE
In this paper, we describe an algorithm called Fast Marching Watersheds that segments a triangle mesh into visual parts. This computer vision algorithm leverages a human vision th...
210
click to vote
STOC
2003
ACM
16 years 8 months ago
2003
ACM
We give efficient algorithms to sample uniformly, and count approximately, the solutions to a zero-one knapsack problem. The algorithm is based on using dynamic programming to pro...
190
click to vote
RECSYS
2009
ACM
16 years 2 months ago
2009
ACM
We consider the problem of recommending the best set of k items when there is an inherent ordering between items, expressed as a set of prerequisites (e.g., the course ‘Real Ana...