2924 search results - page 421 / 585 » Lower Bounds in Distributed Computing |
300
click to vote
ICDE
2008
IEEE
17 years 4 months ago
2008
IEEE
In applications like location-based services, sensor monitoring and biological databases, the values of the database items are inherently uncertain in nature. An important query fo...
140
Voted
SIGECOM
2006
ACM
15 years 10 months ago
2006
ACM
We consider a multicast game with selfish non-cooperative players. There is a special source node and each player is interested in connecting to the source by making a routing de...
164
Voted
KR
2004
Springer
15 years 10 months ago
2004
Springer
One of the major advances in classical planning has been the development of Graphplan. Graphplan builds a layered structure called the planning graph, and then searches this struc...
149
click to vote
EUROCRYPT
2001
Springer
15 years 9 months ago
2001
Springer
Abstract. We consider the question of adaptive security for two related cryptographic primitives: all-or-nothing transforms and exposureresilient functions. Both are concerned with...
113
Voted
FOCS
1993
IEEE
15 years 9 months ago
1993
IEEE
We consider the following scenario. A point robot is placed at some start location ¡ in a 2dimensional scene containing oriented rectangular obstacles. The robot must repeatedly ...