Sciweavers

245 search results - page 13 / 49
» Using Finite State Automata for Sequence Mining
Sort
View
DKE
2006
139views more  DKE 2006»
13 years 7 months ago
Information extraction from structured documents using k-testable tree automaton inference
Information extraction (IE) addresses the problem of extracting specific information from a collection of documents. Much of the previous work on IE from structured documents, suc...
Raymond Kosala, Hendrik Blockeel, Maurice Bruynoog...
GECCO
2005
Springer
135views Optimization» more  GECCO 2005»
14 years 1 months ago
The impact of cellular representation on finite state agents for prisoner's dilemma
The iterated prisoner’s dilemma is a widely used computational model of cooperation and conflict. Many studies report emergent cooperation in populations of agents trained to p...
Daniel A. Ashlock, Eun-Youn Kim
FLAIRS
2001
13 years 9 months ago
Probabilistic Planning for Behavior-Based Robots
Partially Observable Markov Decision Process models (POMDPs) have been applied to low-level robot control. We show how to use POMDPs differently, namely for sensorplanning in the ...
Amin Atrash, Sven Koenig
ACTAC
2006
101views more  ACTAC 2006»
13 years 8 months ago
Cycle Structure in Automata and the Holonomy Decomposition
The algebraic hierarchical decomposition of finite state automata can be applied wherever a finite system should be `understood' using a hierarchical coordinate system. Here ...
Attila Egri-Nagy, Chrystopher L. Nehaniv
CONEXT
2007
ACM
13 years 11 months ago
A hybrid finite automaton for practical deep packet inspection
Deterministic finite automata (DFAs) are widely used to perform regular expression matching in linear time. Several techniques have been proposed to compress DFAs in order to redu...
Michela Becchi, Patrick Crowley