Sciweavers

620 search results - page 50 / 124
» Algorithms and computations on cellular automata
Sort
View
IPPS
2003
IEEE
15 years 5 months ago
GCA: A Massively Parallel Model
We had introduced the massively parallel global cellular automata (GCA) model. Parallel algorithms derived from applications can be mapped straight forward onto this model. In thi...
Rolf Hoffmann, Klaus-Peter Völkmann, Wolfgang...
FORMATS
2006
Springer
15 years 4 months ago
Symbolic Robustness Analysis of Timed Automata
We propose a symbolic algorithm for the analysis of the robustness of timed automata, that is the correctness of the model in presence of small drifts on the clocks or imprecision ...
Conrado Daws, Piotr Kordy
IJFCS
2008
158views more  IJFCS 2008»
15 years 17 days ago
An Alternative Construction in Symbolic Reachability Analysis of Second Order Pushdown Systems
Abstract. Recently, it has been shown that for any higher order pushdown system H and for any regular set C of configurations, the set pre H(C), is regular. In this paper, we give ...
Anil Seth
106
Voted
WIOPT
2010
IEEE
14 years 10 months ago
Iterative power and subcarrier allocation for maximizing WSMR in cellular OFDMA systems
We consider the resource allocation (RA) problem of maximizing the weighted sum of the minimal user rates (WSMR) of coordinated cells subject to a total power constraint at each ba...
Tao Wang, Luc Vandendorpe
110
Voted
LATIN
2010
Springer
15 years 2 months ago
Complexity of Operations on Cofinite Languages
We study the worst case complexity of regular operations on cofinite languages (i.e., languages whose complement is finite) and provide algorithms to compute efficiently the result...
Frédérique Bassino, Laura Giambruno,...