620 search results - page 67 / 124 » Algorithms and computations on cellular automata |
111
click to vote
AAAI
2008
15 years 2 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...
105
click to vote
ACSD
2007
IEEE
15 years 2 months ago
2007
IEEE
We present an improvement of the SAT-based Unbounded Model Checking (UMC) algorithm. UMC, a symbolic approach introduced in [7], uses propositional formulas in conjunctive normal ...
106
click to vote
COLT
1994
Springer
15 years 4 months ago
1994
Springer
: Sequential algorithms given by Angluin 1987 and Schapire 1992 learn deterministic nite automata DFA exactly from Membership and Equivalence queries. These algorithms are feasible...
WWW
2005
ACM
16 years 1 months ago
2005
ACM
Autonomics or self-reorganization becomes pertinent for websites serving a large number of users with highly varying workloads. An important component of self-adaptation is to mod...
104
Voted
DLT
2003
15 years 2 months ago
2003
We present different techniques for reducing the number of states and transitions in nondeterministic automata. These techniques are based on the two preorders over the set of st...