620 search results - page 77 / 124 » Algorithms and computations on cellular automata |
COMPGEOM
2010
ACM
15 years 5 months ago
2010
ACM
Let G be an unweighted graph of complexity n cellularly embedded in a surface (orientable or not) of genus g. We describe improved algorithms to compute (the length of) a shortest...
101
click to vote
SPIN
2004
Springer
15 years 6 months ago
2004
Springer
We propose a new framework for black-box conformance testing of real-time systems, where specifications are modeled as nondeterministic and partially-observable timed automata. We...
120
Voted
COCO
2008
Springer
15 years 2 months ago
2008
Springer
We introduce a simple game family, called Constraint Logic, where players reverse edges in a directed graph while satisfying vertex in-flow constraints. This game family can be in...
111
Voted
CONCUR
2001
Springer
15 years 5 months ago
2001
Springer
We study the maximal reachability probability problem for infinite-state systems featuring both nondeterministic and probabilistic choice. The problem involves the computation of ...
104
Voted
CORR
2011
Springer
14 years 7 months ago
2011
Springer
We study the power of classical and quantum algorithms equipped with nonuniform advice, in the form of a coin whose bias encodes useful information. This question takes on particu...