Sciweavers

346 search results - page 31 / 70
» Determinizing Asynchronous Automata
Sort
View
FUN
2010
Springer
238views Algorithms» more  FUN 2010»
15 years 2 months ago
Mapping an Unfriendly Subway System
We consider a class of highly dynamic networks modelled on an urban subway system. We examine the problem of creating a map of such a subway in less than ideal conditions, where th...
Paola Flocchini, Matthew Kellett, Peter C. Mason, ...
JPDC
2006
94views more  JPDC 2006»
14 years 10 months ago
Exchanging messages of different sizes
This paper deals with the study of the exchange of messages among a set of processors linked through an interconnection network. We focus on general, non-uniform versions of messa...
Alfredo Goldman, Joseph G. Peters, Denis Trystram
WWW
2007
ACM
15 years 10 months ago
Visibly pushdown automata for streaming XML
We propose the study of visibly pushdown automata (Vpa) for processing XML documents. Vpas are pushdown automata where the input determines the stack operation, and XML documents ...
Viraj Kumar, P. Madhusudan, Mahesh Viswanathan
TSMC
1998
78views more  TSMC 1998»
14 years 9 months ago
Automata learning and intelligent tertiary searching for stochastic point location
—Consider the problem of a robot (learning mechanism or algorithm) attempting to locate a point on a line. The mechanism interacts with a random environment which essentially inf...
B. John Oommen, Govindachari Raghunath
ASYNC
1998
IEEE
84views Hardware» more  ASYNC 1998»
15 years 2 months ago
Average-Case Optimized Transistor-Level Technology Mapping of Extended Burst-Mode Circuits
We describe an automated method (3D-map) for determining near-optimal decomposed generalized C-element (gC) implementations of extended burst-mode asynchronous controllers. Averag...
Kevin W. James, Kenneth Y. Yun