1883 search results - page 204 / 377 » Ordered theta graphs |
FCCM
2009
IEEE
14 years 17 hour ago
2009
IEEE
Scheduling and partitioning of task graphs on reconfigurable hardware needs to be carefully carried out in order to achieve the best possible performance. In this paper, we demons...
ER
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. We present a new technique for discovering and representing structural changes between two versions of a directed acyclic graph (DAG). Motivated by the necessity of chang...
IPPS
2000
IEEE
13 years 11 months ago
2000
IEEE
Metacomputing infrastructures couple multiple clusters (or MPPs) via wide-area networks. A major problem in programming parallel applications for such platforms is their hierarchi...
CCECE
2009
IEEE
13 years 11 months ago
2009
IEEE
In this paper we investigate the limits of routing according to left- or righthand rule (LHR). Using LHR, a node upon receipt of a message will forward to the neighbour that sits ...
FLAIRS
2008
13 years 10 months ago
2008
Solving relaxed problems is a commonly used technique in heuristic search to derive heuristic estimates. In heuristic planning, this is usually done by expanding a planning (reach...