2322 search results - page 2 / 465 » On a game in directed graphs |
LPAR
2004
Springer
13 years 10 months ago
2004
Springer
We propose a new parameter for the complexity of finite directed graphs which measures to what extent the cycles of the graph are intertwined. This measure, called entanglement, i...
ISAAC
2009
Springer
13 years 11 months ago
2009
Springer
We consider some well-known families of two-player zero-sum perfect-information stochastic games played on finite directed graphs. Generalizing and unifying results of Liggett and...
FSTTCS
2008
Springer
13 years 6 months ago
2008
Springer
An average-time game is played on the infinite graph of configurations of a finite timed automaton. The two players, Min and Max, construct an infinite run of the automaton by ...
CEC
2008
IEEE
13 years 11 months ago
2008
IEEE
Abstract— This paper presents a genetic algorithmic approach for finding efficient paths in directed graphs when optimizing multiple objectives. Its aim is to provide solutions...
MFCS
2010
Springer
13 years 3 months ago
2010
Springer
Abstract. We address the strategy problem for parity games with partial information and observable colors, played on finite graphs of bounded graph complexity. We consider several...