832 search results - page 116 / 167 » Parallel algorithms for solving aggregated shortest-path pro... |
AINA
2005
IEEE
15 years 3 months ago
2005
IEEE
The network lifetime for wireless sensor network plays an important role to survivability. Thus, we indicate the importance of routing protocol to network lifetime, and model the ...
CPAIOR
2006
Springer
15 years 1 months ago
2006
Springer
Temporal planning (TP) is notoriously difficult because it requires to solve a propositional STRIPS planning problem with temporal constraints. In this paper, we propose an efficie...
PODC
2010
ACM
14 years 11 months ago
2010
ACM
Low overhead analysis of large distributed data sets is necessary for current data centers and for future sensor networks. In such systems, each node holds some data value, e.g., ...
FOCS
1998
IEEE
15 years 2 months ago
1998
IEEE
This paper deals with the evaluation of acyclic Boolean conjunctive queries in relational databases. By well-known results of Yannakakis [1981], this problem is solvable in polynom...
FMOODS
2007
14 years 11 months ago
2007
Abstract. Algorithmic skeletons are a well-known approach for implementing parallel and distributed applications. Declarative versions typically use higher-order functions in funct...