83 search results - page 14 / 17 » Optimization of a Billiard Player - Tactical Play |
110
click to vote
PODC
2012
ACM
13 years 9 days ago
2012
ACM
Multi-party communication complexity involves distributed computation of a function over inputs held by multiple distributed players. A key focus of distributed computing research...
INFOCOM
2005
IEEE
15 years 3 months ago
2005
IEEE
— In this paper, we study the interaction between overlay routing and Traffic Engineering (TE) in a single Autonomous System (AS). We formulate this interaction as a twoplayer n...
GECCO
2006
Springer
15 years 1 months ago
2006
Springer
Classical chess engines exhaustively explore moving possibilities from a chessboard configuration to choose what the next best move to play is. In this article we present a new me...
GECCO
2006
Springer
15 years 1 months ago
2006
Springer
The Layered Pareto Coevolution Archive (LAPCA) was recently proposed as an effective Coevolutionary Memory (CM) which, under certain assumptions, approximates monotonic progress i...
AAAI
2010
14 years 11 months ago
2010
Perfect Information Monte Carlo (PIMC) search is a practical technique for playing imperfect information games that are too large to be optimally solved. Although PIMC search has ...