Sciweavers

5374 search results - page 785 / 1075
» The induction of communication protocols
Sort
View
ACTA
2010
104views more  ACTA 2010»
15 years 7 months ago
Reachability results for timed automata with unbounded data structures
Systems of Data Management Timed Automata (SDMTAs) are networks of communicating timed automata with structures to store messages and functions to manipulate them. We prove the dec...
Ruggero Lanotte, Andrea Maggiolo-Schettini, Angelo...
CCR
2008
90views more  CCR 2008»
15 years 7 months ago
Censor networks: a critique of "sensor networks" from a systems perspective
This writeup presents a critique of the field of "Wireless Sensor Networks (WSNs)". Literature in this domain falls into two main, distinct categories: (1) algorithms or...
Bhaskaran Raman, Kameswari Chebrolu
CJ
2008
108views more  CJ 2008»
15 years 7 months ago
Computing with Time: From Neural Networks to Sensor Networks
This article advocates a new computing paradigm, called computing with time, that is capable of efficiently performing a certain class of computation, namely, searching in paralle...
Boleslaw K. Szymanski, Gilbert Chen
218
Voted
CSJM
2008
112views more  CSJM 2008»
15 years 7 months ago
About Precise Characterization of Languages Generated by Hybrid Networks of Evolutionary Processors with One Node
A hybrid network of evolutionary processors (an HNEP) is a graph where each node is associated with an evolutionary processor (a special rewriting system), a set of words, an inpu...
Artiom Alhazov, Yurii Rogozhin
ENTCS
2006
154views more  ENTCS 2006»
15 years 7 months ago
PMaude: Rewrite-based Specification Language for Probabilistic Object Systems
We introduce a rewrite-based specification language for modelling probabilistic concurrent and distributed systems. The language, based on PMaude, has both a rigorous formal basis...
Gul A. Agha, José Meseguer, Koushik Sen