Sciweavers

81 search results - page 7 / 17
» A Formalisation of Finite Automata Using Hereditarily Finite...
Sort
View
ICC
2011
IEEE
237views Communications» more  ICC 2011»
13 years 9 months ago
Reorganized and Compact DFA for Efficient Regular Expression Matching
—Regular expression matching has become a critical yet challenging technique in content-aware network processing, such as application identification and deep inspection. To meet ...
Kai Wang, Yaxuan Qi, Yibo Xue, Jun Li
LPAR
2010
Springer
14 years 7 months ago
Coping with Selfish On-Going Behaviors
A rational and selfish environment may have an incentive to cheat the system it interacts with. Cheating the system amounts to reporting a stream of inputs that is different from ...
Orna Kupferman, Tami Tamir
GECCO
2007
Springer
189views Optimization» more  GECCO 2007»
15 years 3 months ago
A more bio-plausible approach to the evolutionary inference of finite state machines
With resemblance of finite-state machines to some biological mechanisms in cells and numerous applications of finite automata in different fields, this paper uses analogies an...
Hooman Shayani, Peter J. Bentley
73
Voted
GECCO
2005
Springer
135views Optimization» more  GECCO 2005»
15 years 3 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
68
Voted
ICRA
2003
IEEE
116views Robotics» more  ICRA 2003»
15 years 2 months ago
Learning to role-switch in multi-robot systems
We present an approach that uses Q-learning on individual robotic agents, for coordinating a missiontasked team of robots in a complex scenario. To reduce the size of the state sp...
Eric Martinson, Ronald C. Arkin