2924 search results - page 323 / 585 » Lower Bounds in Distributed Computing |
146
click to vote
ICCAD
2010
IEEE
15 years 2 months ago
2010
IEEE
Elastic systems, either synchronous or asynchronous, can be optimized for the average-case performance when they have units with early evaluation or variable latency. The performan...
148
click to vote
ICCAD
2010
IEEE
15 years 1 months ago
2010
IEEE
Global Routing has been a traditional EDA problem. It has congestion elimination as the first and foremost priority. Despite of the recent development for popular rip-up and rerout...
152
click to vote
MST
2011
14 years 11 months ago
2011
Hierarchical graph definitions allow a modular description of graphs using modules for the specification of repeated substructures. Beside this modularity, hierarchical graph de...
137
click to vote
CORR
2011
Springer
14 years 8 months ago
2011
Springer
: The PDPTW is an optimization vehicles routing problem which must meet requests for transport between suppliers and customers satisfying precedence, capacity and time constraints....
146
click to vote
IPPS
1997
IEEE
15 years 8 months ago
1997
IEEE
This paper presents a compile-time scheme for partitioning non-rectangular loop nests which consist of inner loops whose bounds depend on the index of the outermost, parallel loop...