29908 search results - page 241 / 5982 » On the Complexity of |
225
click to vote
HYBRID
2000
Springer
15 years 10 months ago
2000
Springer
Abstract. We define a new class of hybrid automata for which reachability is decidable--a proper superclass of the initialized rectangular hybrid automata--by taking parallel compo...
162
click to vote
IFIP
2000
Springer
15 years 10 months ago
2000
Springer
New non-desktop technologies may turn out to be of a more open and generic nature than traditional information technologies. These technologies consequently pose novel challenges ...
154
click to vote
FSTTCS
1994
Springer
15 years 10 months ago
1994
Springer
We give an interactive protocol for s-t RELIABILITY, the well known reliability problem on graphs. Our protocol shows that if IP(f(n)) denotes the class of languages whose interac...
190
click to vote
CIKM
2008
Springer
15 years 8 months ago
2008
Springer
Searching data streams has been traditionally very limited, either in the complexity of the search or in the size of the searched dataset. In this paper, we investigate the design...
161
click to vote
COCOON
2008
Springer
15 years 8 months ago
2008
Springer
We analyze the complexity of equilibria problems for a class of strategic zero-sum games, called Angel-Daemon games. Those games were introduced to asses the goodness of a web or g...