Sciweavers

3455 search results - page 310 / 691
» Generalized Game Trees
Sort
View
ICALP
2004
Springer
16 years 2 days ago
A Calculus of Coroutines
We describe a simple but expressive calculus of sequential processes, represented as coroutines. We show that this calculus can be used to express a variety of programming languag...
James Laird
WAOA
2004
Springer
111views Algorithms» more  WAOA 2004»
16 years 1 days ago
More Powerful and Simpler Cost-Sharing Methods
We provide a new technique to derive group strategyproof mechanisms for the cost-sharing problem. Our technique is simpler and provably more powerful than the existing one based on...
Paolo Penna, Carmine Ventre
ACG
2003
Springer
15 years 12 months ago
Search versus Knowledge: An Empirical Study of Minimax on KRK
This article presents the results of an empirical experiment designed to gain insight into what is the effect of the minimax algorithm on the evaluation function. The experiment’...
Aleksander Sadikov, Ivan Bratko, Igor Kononenko
AAAI
2006
15 years 8 months ago
Targeting Specific Distributions of Trajectories in MDPs
We define TTD-MDPs, a novel class of Markov decision processes where the traditional goal of an agent is changed from finding an optimal trajectory through a state space to realiz...
David L. Roberts, Mark J. Nelson, Charles Lee Isbe...
AAAI
1994
15 years 8 months ago
Evolving Neural Networks to Focus Minimax Search
Neural networks were evolved through genetic algorithms to focus minimax search in the game of Othello. At each level of the search tree, the focus networks decide which moves are...
David E. Moriarty, Risto Miikkulainen