28 search results - page 4 / 6 » Algorithms for Finding Approximate Formations in Games |
120
click to vote
FORMATS
2010
Springer
14 years 9 months ago
2010
Springer
We present a general approach to combine symbolic state space representations for the discrete and continuous parts in the synthesis of winning strategies for timed reachability ga...
ATAL
2010
Springer
14 years 6 months ago
2010
Springer
The Affine ADD (AADD) is an extension of the Algebraic Decision Diagram (ADD) that compactly represents context-specific, additive and multiplicative structure in functions from a...
CORR
2010
Springer
14 years 11 months ago
2010
Springer
It is well known that a stable matching in a many-to-one matching market with couples need not exist. We introduce a new matching algorithm for such markets and show that for a ge...
ICALP
2009
Springer
15 years 11 months ago
2009
Springer
We improve the approximation ratios for two optimization problems in planar graphs. For node-weighted Steiner tree, a classical network-optimization problem, the best achievable ap...
AIIDE
2006
15 years 10 days ago
2006
Reinforcement learning is an effective machine learning paradigm in domains represented by compact and discrete state-action spaces. In high-dimensional and continuous domains, ti...