5090 search results - page 722 / 1018 » Constructing Strategies for Programming |
186
click to vote
ICAISC
2010
Springer
15 years 8 months ago
2010
Springer
Abstract. Multigame playing agents are programs capable of autonomously learning to play new, previously unknown games. In this paper, we concentrate on the General Game Playing Co...
176
click to vote
APPROX
2010
Springer
15 years 8 months ago
2010
Springer
In this paper, we investigate whether a constant round Lasserre Semi-definite Programming (SDP) relaxation might give a good approximation to the UNIQUE GAMES problem. We show tha...
179
click to vote
NIPS
2008
15 years 8 months ago
2008
We introduce a new probability distribution over a potentially infinite number of binary Markov chains which we call the Markov Indian buffet process. This process extends the IBP...
166
click to vote
NAACL
2007
15 years 8 months ago
2007
The task of selecting and ordering information appears in multiple contexts in text generation and summarization. For instance, methods for title generation construct a headline b...
193
click to vote
AAAI
2006
15 years 8 months ago
2006
Intelligent agents must be able to handle the complexity and uncertainty of the real world. Logical AI has focused mainly on the former, and statistical AI on the latter. Markov l...