Sciweavers

1246 search results - page 93 / 250
» Recursive Timed Automata
Sort
View
AHSWN
2010
177views more  AHSWN 2010»
15 years 29 days ago
Dynamic Point Coverage Problem in Wireless Sensor Networks: A Cellular Learning Automata Approach
One way to prolong the lifetime of a wireless sensor network is to schedule the active times of sensor nodes, so that a node is active only when it is really needed. In the dynami...
Mehdi Esnaashari, Mohammad Reza Meybodi
CC
2003
Springer
141views System Software» more  CC 2003»
15 years 6 months ago
A New One-Pass Transformation into Monadic Normal Form
We present a translation from the call-by-value λ-calculus to monadic normal forms that includes short-cut boolean evaluation. The translation is higher-order, operates in one pas...
Olivier Danvy
77
Voted
ICPR
2000
IEEE
15 years 5 months ago
Unsupervised Segmentation of Poisson Data
This paper describes a new approach to the analysis of Poisson point processes, in time (1D) or space (2D), which is based on the minimum description length (MDL) framework. Speci...
Robert D. Nowak, Mário A. T. Figueiredo
FORMATS
2004
Springer
15 years 6 months ago
Learning of Event-Recording Automata
Abstract. We extend Angluin’s algorithm for on-line learning of regular languages to the setting of timed systems. We consider systems that can be described by a class of determi...
Olga Grinchtein, Bengt Jonsson, Martin Leucker
FOSSACS
2006
Springer
15 years 4 months ago
Denotational Semantics of Hybrid Automata
Abstract. We introduce a denotational semantics for non-linear hybrid automata, and relate it to the operational semantics given in terms of hybrid trajectories. The semantics is d...
Abbas Edalat, Dirk Pattinson