6045 search results - page 961 / 1209 » Computable Linearizations of Well-partial-orderings |
183
click to vote
AAAI
2008
15 years 9 months ago
2008
This paper proposes an optimal approach to infinite-state action planning exploiting automata theory. State sets and actions are characterized by Presburger formulas and represent...
167
click to vote
ECCV
2010
Springer
15 years 8 months ago
2010
Springer
This paper proposes a framework that provides significant speed-ups and also improves the effectiveness of general message passing algorithms based on dual LP relaxations. It is ap...
166
click to vote
BIRTHDAY
2008
Springer
15 years 8 months ago
2008
Springer
We show that the category FinVectk of finite dimensional vector spaces and linear maps over any field k is (collectively) complete for the traced symmetric monoidal category freely...
155
click to vote
ASPDAC
2005
ACM
15 years 8 months ago
2005
ACM
Abstract— Today’s embedded systems are typically distributed and more often confronted with timevarying demands. Existing methodologies that optimize the partitioning of comput...
174
click to vote
CG
2006
Springer
15 years 8 months ago
2006
Springer
Temporal difference (TD) learning has been used to learn strong evaluation functions in a variety of two-player games. TD-gammon illustrated how the combination of game tree search...