Sciweavers

1599 search results - page 198 / 320
» Algorithms for Parity Games
Sort
View
AAAI
1996
15 years 7 months ago
Learning Models of Intelligent Agents
Agents that operate in a multi-agent system need an efficient strategy to handle their encounters with other agents involved. Searching for an optimal interactive strategy is a ha...
David Carmel, Shaul Markovitch
JUCS
2008
104views more  JUCS 2008»
15 years 6 months ago
Optimal Transit Price Negotiation: The Distributed Learning Perspective
: We present a distributed learning algorithm for optimizing transit prices in the inter-domain routing framework. We present a combined game theoretical and distributed algorithmi...
Dominique Barth, Loubna Echabbi, Chahinez Hamlaoui
JUCS
2007
105views more  JUCS 2007»
15 years 6 months ago
Graded Sparse Graphs and Matroids
: Sparse graphs and their associated matroids play an important role in rigidity theory, where they capture the combinatorics of some families of generic minimally rigid structures...
Audrey Lee, Ileana Streinu, Louis Theran
ICRA
2010
IEEE
128views Robotics» more  ICRA 2010»
15 years 4 months ago
A game-theoretic procedure for learning hierarchically structured strategies
— This paper addresses the problem of acquiring a hierarchically structured robotic skill in a nonstationary environment. This is achieved through a combination of learning primi...
Benjamin Rosman, Subramanian Ramamoorthy
CG
2010
Springer
15 years 4 months ago
Biasing Monte-Carlo Simulations through RAVE Values
Abstract. The Monte-Carlo Tree Search algorithm has been successfully applied in various domains. However, its performance heavily depends on the Monte-Carlo part. In this paper, w...
Arpad Rimmel, Fabien Teytaud, Olivier Teytaud