3220 search results - page 466 / 644 » Constrained Graph Processes |
160
click to vote
EPIA
2001
Springer
15 years 11 months ago
2001
Springer
Dealing with temporality on actions presents an important challenge to AI planning. Unlike Graphplan-based planners which alternate levels of propositions and actions in a regular ...
178
click to vote
ICPP
2000
IEEE
15 years 10 months ago
2000
IEEE
We consider an efficient distributed algorithm for determining a dominating and absorbant set of vertices (mobile hosts) in a given directed graph that represents an ad hoc wirel...
165
click to vote
PVM
1997
Springer
15 years 10 months ago
1997
Springer
The traditional approach to the parallelization of linear algebra algorithms such as matrix multiplication and LU factorization calls for static allocation of matrix blocks to proc...
143
click to vote
DATE
2004
IEEE
15 years 10 months ago
2004
IEEE
This paper presents an exploration algorithm which examines execution time and energy consumption of a given application, while considering a parameterized memory architecture. Th...
139
click to vote
ESA
2006
Springer
15 years 10 months ago
2006
Springer
In this paper we introduce and study cooperative variants of the Traveling Salesperson Problem. In these problems a salesperson has to make deliveries to customers who are willing ...