67 search results - page 5 / 14 » A heuristic method for the minimum toll booth problem |
INFOCOM
2006
IEEE
15 years 3 months ago
2006
IEEE
— Service Composition is a promising technology for providing on-demand services in dynamic and loosely coupled peerto-peer (P2P) networks. Because of system dynamics, such as th...
ICCAD
1999
IEEE
15 years 1 months ago
1999
IEEE
We introduce the associative skew clock routing problem, which seeks a clock routing tree such that zero skew is preserved only within identified groups of sinks. The associative ...
118
click to vote
ISPD
1997
ACM
15 years 1 months ago
1997
ACM
The wire sizing problem under inequality Elmore delay constraints is known to be posynomial, hence convex under an exponential variable-transformation. There are formal methods fo...
GECCO
2007
Springer
15 years 3 months ago
2007
Springer
Dividing the set of nodes into clusters in the well-known traveling salesman problem results in the generalized traveling salesman problem which seeking a tour with minimum cost p...
GECCO
2009
Springer
15 years 2 months ago
2009
Springer
Given a collection of terminals, each with a demand, a collection of concentrators, each with a capacity, and costs of connecting the terminals to the concentrators, the terminal ...