13 search results - page 2 / 3 » nsf 1994 |
FOCS
1994
IEEE
13 years 8 months ago
1994
IEEE
We show that two cooperating robots can learn exactly any strongly-connected directed graph with n indistinguishable nodes in expected time polynomial in n. We introduce a new typ...
SC
1994
ACM
13 years 8 months ago
1994
ACM
In adaptive irregular problems the data arrays are accessed via indirection arrays, and data access patterns change during computation. Implementingsuch problems ondistributed mem...
FOCS
1994
IEEE
13 years 8 months ago
1994
IEEE
We introduce a new method, called Priority Encoding Transmission, for sending messages over lossy packet-based networks. When a message is to be transmitted, the user speci es a p...
ERCIMDL
1998
Springer
13 years 8 months ago
1998
Springer
Abstract. Since 1994, the Alexandria Digital Library Project has developed three prototype digital libraries for georeferenced information. This paper describes the most recent of ...
LICS
1994
IEEE
13 years 8 months ago
1994
IEEE
The modal mu-calculus is an expressive logic that can be used to specify safety and liveness properties of concurrent systems represented as labeled transition systems (LTSs). We ...