829 search results - page 73 / 166 » Making Microrobots Move |
236
Voted
LCC
1994
15 years 6 months ago
1994
The descriptive complexity of a problem is the complexity of describing the problem in some logical formalism. One of the few techniques for proving separation results in descripti...
156
Voted
HIPC
2009
Springer
15 years 10 days ago
2009
Springer
Stream computing research is moving from terascale to petascale levels. It aims to rapidly analyze data as it streams in from many sources and make decisions with high speed and a...
106
Voted
MOBIHOC
2009
ACM
16 years 3 months ago
2009
ACM
Routing is one of the most challenging open problems in disruption-tolerant networks (DTNs) because of the shortlived wireless connectivity environment. To deal with this issue, r...
127
click to vote
OSDI
2002
ACM
16 years 2 months ago
2002
ACM
This paper shows how to quickly move the state of a running computer across a network, including the state in its disks, memory, CPU registers, and I/O devices. We call this state...
213
Voted
SIGMOD
2009
ACM
16 years 2 months ago
2009
ACM
This paper addresses the problem of monitoring the k nearest neighbors to a dynamically changing path in road networks. Given a destination where a user is going to, this new quer...