Sciweavers

211 search results - page 8 / 43
» Solving Games Without Determinization
Sort
View
AAAI
2006
13 years 8 months ago
A Value Theory of Meta-Learning Algorithms
We use game theory to analyze meta-learning algorithms. The objective of meta-learning is to determine which algorithm to apply on a given task. This is an instance of a more gene...
Abraham Bagherjeiran
ATAL
2008
Springer
13 years 9 months ago
Searching for approximate equilibria in empirical games
When exploring a game over a large strategy space, it may not be feasible or cost-effective to evaluate the payoff of every relevant strategy profile. For example, determining a p...
Patrick R. Jordan, Yevgeniy Vorobeychik, Michael P...
SOICT
2010
13 years 1 months ago
Constraint-based local search for solving non-simple paths problems on graphs: application to the routing for network covering p
Routing problems have been considered as central problems in the fields of transportation, distribution and logistics. LS(Graph) is a generic framework allowing to model and solve...
Pham Quang Dung, Phan-Thuan Do, Yves Deville, Tuon...
SIGECOM
2006
ACM
143views ECommerce» more  SIGECOM 2006»
14 years 1 months ago
The computational complexity of nash equilibria in concisely represented games
Games may be represented in many different ways, and different representations of games affect the complexity of problems associated with games, such as finding a Nash equilib...
Grant Schoenebeck, Salil P. Vadhan
ISWC
1997
IEEE
13 years 11 months ago
Stochasticks: Augmenting the Billiards Experience with Probabilistic Vision and Wearable Computers
We propose a practical application of wearable computing and augmented reality which enhances the game of billiards. A vision algorithm is implemented which operates in interactiv...
Tony Jebara, Cyrus Eyster, Joshua Weaver, Thad Sta...