8009 search results - page 176 / 1602 » cans 2005 |
162
click to vote
VLDB
2005
ACM
15 years 12 months ago
2005
ACM
This paper presents a set of algorithms for efficiently evaluating join queries over static data tables in sensor networks. We describe and evaluate three algorithms that take adv...
186
click to vote
WADS
2005
Springer
15 years 12 months ago
2005
Springer
Given a forest F = (V, E) and a positive integer D, we consider the problem of finding a minimum number of new edges E such that in the augmented graph H = (V, E∪E ) any pair of...
140
click to vote
WEA
2005
Springer
15 years 12 months ago
2005
Springer
We consider the problem of finding a door along a wall with a blind robot that neither knows the distance to the door nor the direction towards of the door. This problem can be so...
172
click to vote
WEBI
2005
Springer
15 years 12 months ago
2005
Springer
The realization of the Semantic Web needs a set of specialized middleware as its infrastructure. In this paper we describe the principles of tuplespace computing, explain why tupl...
146
click to vote
WLP
2005
Springer
15 years 12 months ago
2005
Springer
Constraint Propagation can be speeded up significantly by choosing a good execution order for propagators. A propagator is an implicit representation of a constraint which is wide...