Sciweavers

124 search results - page 5 / 25
» Antichain Algorithms for Finite Automata
Sort
View
CORR
2010
Springer
79views Education» more  CORR 2010»
13 years 4 months ago
Probabilistic cellular automata, invariant measures, and perfect sampling
In a probabilistic cellular automaton (PCA), the cells are updated synchronously and independently, according to a distribution depending on a finite neighborhood. A PCA can be vi...
Ana Busic, Jean Mairesse, Irene Marcovici
ICRA
2009
IEEE
266views Robotics» more  ICRA 2009»
14 years 2 months ago
Behavioral control for multi-robot perimeter patrol: A Finite State Automata approach
Abstract— This paper proposes a multiple robot control algorithm to approach the problem of patrolling an open or closed line. The algorithm is fully decentralized, i.e., no comm...
Alessandro Marino, Lynne E. Parker, Gianluca Anton...
IJCSA
2007
104views more  IJCSA 2007»
13 years 7 months ago
Solving the Satisfiability Problem Using Finite Learning Automata
A large number of problems that occur in knowledge-representation, learning, VLSI-design, and other areas of artificial intelligence, are essentially satisfiability problems. The ...
Ole-Christoffer Granmo, Noureddine Bouhmala
COLT
1995
Springer
13 years 11 months ago
On the Learnability and Usage of Acyclic Probabilistic Finite Automata
We propose and analyze a distribution learning algorithm for a subclass of Acyclic Probabilistic Finite Automata (APFA). This subclass is characterized by a certain distinguishabi...
Dana Ron, Yoram Singer, Naftali Tishby
AAAI
2008
13 years 9 months ago
Optimal Metric Planning with State Sets in Automata Representation
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...
Björn Ulrich Borowsky, Stefan Edelkamp