18090 search results - page 386 / 3618 » Computing by Only Observing |
146
click to vote
ICDT
2005
ACM
16 years 7 days ago
2005
ACM
d abstract) Foto Afrati1 and Rada Chirkova2 1 Electrical and Computing Eng., National Technical University of Athens, 157 73 Athens, Greece 2 Computer Science Department, North Car...
196
click to vote
SSD
2005
Springer
16 years 6 days ago
2005
Springer
This paper proposes and solves a-autonomy and k-stops shortest path problems in large spatial databases. Given a source s and a destination d, an aautonomy query retrieves a sequen...
172
click to vote
UC
2005
Springer
16 years 6 days ago
2005
Springer
Abstract. We study computational complexity of counting the fixed point configurations (FPs) in certain classes of graph automata viewed as discrete dynamical systems. We prove t...
171
click to vote
SC
2003
ACM
15 years 12 months ago
2003
ACM
We investigate runtime strategies for data-intensive applications that involve generalized reductions on large, distributed datasets. Our set of strategies includes replicated fi...
188
click to vote
CONCUR
2001
Springer
15 years 11 months ago
2001
Springer
We study the maximal reachability probability problem for infinite-state systems featuring both nondeterministic and probabilistic choice. The problem involves the computation of ...