1074 search results - page 56 / 215 » Parallelizing post-placement timing optimization |
ICDCS
1998
IEEE
14 years 1 months ago
1998
IEEE
We address the problem of efficient circuit switching in wide area networks. The solution provided is based on finding optimal routes for lightpaths and semilightpaths. A lightpat...
ICPP
1993
IEEE
14 years 1 months ago
1993
IEEE
Task graphs are used for scheduling tasks on parallel processors when the tasks have dependencies. If the execution of the program is known ahead of time, then the tasks can be st...
EUROPAR
2004
Springer
14 years 2 months ago
2004
Springer
In hot-potato (deflection) routing, nodes in the network have no buffers for packets in transit, so that some conflicting packets must be deflected away from their destination...
ICDCSW
2003
IEEE
14 years 2 months ago
2003
IEEE
—One of the principal characteristics of large scale wireless sensor networks is their distributed, multi-hop nature. Due to this characteristic, applications such as query propa...
PAMI
2010
13 years 7 months ago
2010
—We propose a combinatorial solution to determine the optimal elastic matching of a deformable template to an image. The central idea is to cast the optimal matching of each temp...