Sciweavers

1705 search results - page 62 / 341
» Representing Constraints with Automata
Sort
View
ICGI
2010
Springer
13 years 8 months ago
Learning PDFA with Asynchronous Transitions
In this paper we extend the PAC learning algorithm due to Clark and Thollard for learning distributions generated by PDFA to automata whose transitions may take varying time length...
Borja Balle, Jorge Castro, Ricard Gavaldà
WCRE
2007
IEEE
14 years 4 months ago
Dynamic Protocol Recovery
Dynamic protocol recovery tries to recover a component’s sequencing constraints by means of dynamic analysis. This problem has been tackled by several automaton learning approac...
Jochen Quante, Rainer Koschke
WONS
2005
IEEE
14 years 3 months ago
Dynamic Power Management in Wireless Sensor Networks: An Application-Driven Approach
Energy is a limited resource in wireless sensor networks. In fact, the reduction of power consumption is crucial to increase the lifetime of low power sensor networks. Several app...
Rodrigo M. Passos, Claudionor José Nunes Co...
MEDINFO
2007
102views Healthcare» more  MEDINFO 2007»
13 years 11 months ago
Automatic Treatment of Temporal Issues in Clinical Guidelines in the GLARE System
Temporal constraints play a fundamental role in clinical guidelines. For example, temporal indeterminacy, constraints about duration, delays between actions and periodic repetitio...
Luca Anselma, Paolo Terenziani, Stefania Montani, ...
ACRI
2008
Springer
14 years 4 months ago
On the Representation of Gliders in Rule 54 by De Bruijn and Cycle Diagrams
Abstract. Rule 54, in Wolfram’s notation, is one of elementary yet complexly behaving one-dimensional cellular automata. The automaton supports gliders, glider guns and other non...
Genaro Juárez Martínez, Andrew Adama...