1410 search results - page 233 / 282 » The Algorithmics of Solitaire-Like Games |
129
click to vote
CORR
2007
Springer
15 years 3 months ago
2007
Springer
—We consider an agent interacting with an unmodeled environment. At each time, the agent makes an observation, takes an action, and incurs a cost. Its actions can influence futu...
179
Voted
SIAMCOMP
2011
14 years 10 months ago
2011
Abstract. In the 2nd Annual FOCS (1961), Chao-Kong Chow proved that every Boolean threshold function is uniquely determined by its degree-0 and degree-1 Fourier coefficients. These...
182
click to vote
SIGECOM
2011
ACM
14 years 6 months ago
2011
ACM
The Generalized Second Price (GSP) auction is the primary method by which sponsered search advertisements are sold. We study the performance of this auction in the Bayesian settin...
139
Voted
SODA
2012
ACM
13 years 5 months ago
2012
ACM
The Densest k-subgraph problem (i.e. find a size k subgraph with maximum number of edges), is one of the notorious problems in approximation algorithms. There is a significant g...
133
click to vote
ESA
2008
Springer
15 years 5 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...