26 search results - page 2 / 6 » Optimal Graph Transformation Assuming Alternate Scheduling M... |
WAOA
2004
Springer
13 years 10 months ago
2004
Springer
Borodin, Nielsen and Rackoff [5] proposed a framework for ing the main properties of greedy-like algorithms with emphasis on scheduling problems, and Davis and Impagliazzo [6] ext...
TCAD
1998
13 years 4 months ago
1998
— We introduce a transformation, named rephasing, that manipulates the timing parameters in control-data-flow graphs (CDFG’s) during the high-level synthesis of data-pathinten...
CP
2003
Springer
13 years 10 months ago
2003
Springer
Abstract. Interleaved planning and scheduling employs the idea of extending partial plans by regularly heeding to the scheduling constraints during search. One of the techniques us...
CGF
2008
13 years 5 months ago
2008
We present an unsupervised algorithm for aligning a pair of shapes in the presence of significant articulated motion and missing data, while assuming no knowledge of a template, u...
EMSOFT
2010
Springer
13 years 3 months ago
2010
Springer
Constructing correct distributed systems from their high-level models has always been a challenge and often subject to serious errors because of their non-deterministic and non-at...