402 search results - page 51 / 81 » Probability, Parallelism and the State Space Exploration Pro... |
113
click to vote
GECCO
2008
Springer
15 years 4 months ago
2008
Springer
We attack the problem of game balancing by using a coevolutionary algorithm to explore the space of possible game strategies and counter strategies. We define balanced games as g...
132
Voted
IEEEPACT
2007
IEEE
15 years 9 months ago
2007
IEEE
Loop nest optimization is a combinatorial problem. Due to the growing complexity of modern architectures, it involves two increasingly difficult tasks: (1) analyzing the profita...
158
Voted
CONCUR
1999
Springer
15 years 7 months ago
1999
Springer
Abstract. The paper presents a partial order reduction method applicable to networks of timed automata. The advantage of the method is that it reduces both the number of explored c...
122
Voted
ISRR
2001
Springer
15 years 8 months ago
2001
Springer
This paper describes the foundations and algorithms of a new probabilistic roadmap (PRM) planner that is: (1) singlequery –i.e., it does not pre-compute a roadmap, but uses the ...
163
Voted
ACCV
2006
Springer
15 years 7 months ago
2006
Springer
Stochastic grammar has been used in many video analysis and event recognition applications as an efficient model to represent large-scale video activity. However, in previous works...