10988 search results - page 190 / 2198 » Algorithmic Folding Complexity |
125
Voted
ATAL
2006
Springer
15 years 7 months ago
2006
Springer
This paper presents complexity results for model checking concurrent programs against temporal-epistemic formulae. We apply these results to evaluate the complexity of verifying p...
127
Voted
TNN
2008
15 years 3 months ago
2008
In this paper, we use complex analytic functions to achieve independent component analysis (ICA) by maximization of non-Gaussianity and introduce the complex maximization of nonGau...
103
Voted
EUROPAR
2007
Springer
15 years 9 months ago
2007
Springer
We present in detail a GCA (Global Cellular Automaton) algorithm with 3n cells for Hirschberg’s algorithm which determines the connected components of a n-node undirected graph w...
148
Voted
ISCC
1999
IEEE
15 years 7 months ago
1999
IEEE
Due to the wide range of services being supported, telecommunications networks are loaded with massive quantities of information. This stimulates extra concern for network surviva...
129
click to vote
CAV
2008
Springer
15 years 5 months ago
2008
Springer
Although there are many efficient algorithms for calculating the simulation preorder on finite Kripke structures, only two have been proposed of which the space complexity is of t...