Sciweavers

620 search results - page 48 / 124
» Algorithms and computations on cellular automata
Sort
View
VTC
2006
IEEE
175views Communications» more  VTC 2006»
15 years 6 months ago
On-Demand Channel Assignment Using Channel Segregation for Uplink DS-CDMA Multi-Hop Virtual Cellular Network
— In order to avoid the large peak transmit power, resulting from the high transmission rates expected for future mobile communication systems, a wireless multi-hop virtual cellu...
Lalla Soundous El Alami, Eisuke Kudoh, Fumiyuki Ad...
114
Voted
IANDC
2007
107views more  IANDC 2007»
15 years 15 days ago
Task automata: Schedulability, decidability and undecidability
We present a model, task automata, for real time systems with non-uniformly recurring computation tasks. It is an extended version of timed automata with asynchronous processes th...
Elena Fersman, Pavel Krcál, Paul Pettersson...
ECOOPW
1998
Springer
15 years 4 months ago
Development and Utilization of Parallel Generic Algorithms for Scientific Computations
We develop generic parallel algorithms as extensible modules that encapsulate related classes and parallel methods. Extensible modules define common parallel structures, such as m...
Atanas Radenski, A. Vann, Boyana Norris
88
Voted
CONCUR
2010
Springer
15 years 1 months ago
Mean-Payoff Automaton Expressions
Abstract. Quantitative languages are an extension of boolean languages that assign to each word a real number. Mean-payoff automata are finite automata with numerical weights on tr...
Krishnendu Chatterjee, Laurent Doyen, Herbert Edel...
111
Voted
QEST
2008
IEEE
15 years 7 months ago
Quantitative Model-Checking of One-Clock Timed Automata under Probabilistic Semantics
In [3] a probabilistic semantics for timed automata has been defined in order to rule out unlikely (sequences of) events. The qualitative model-checking problem for LTL propertie...
Nathalie Bertrand, Patricia Bouyer, Thomas Brihaye...