511 search results - page 63 / 103 » Using Combinatorial Optimization Methods for Quantification ... |
SIAMCOMP
2000
14 years 9 months ago
2000
We present a linear programming-based method for nding \gadgets", i.e., combinatorial structures reducing constraints of one optimization problem to constraints of another. A...
GD
2006
Springer
15 years 1 months ago
2006
Springer
The planarization method has proven to be successful in graph drawing. The output, a combinatorial planar embedding of the so-called planarized graph, can be combined with state-o...
117
click to vote
GECCO
2008
Springer
14 years 10 months ago
2008
Springer
We first present a method, called Two-Phase Pareto Local Search, to find a good approximation of the efficient set of the biobjective traveling salesman problem. In the first p...
ICCAD
2009
IEEE
14 years 7 months ago
2009
IEEE
In a behavioral synthesis system, a typical approach used to guide the scheduler is to impose hard constraints on the relative timing between operations considering performance, a...
DAC
2001
ACM
15 years 10 months ago
2001
ACM
Asynchronous design has been the focus of renewed interest. However, a key bottleneck is the lack of high-quality CAD tools for the synthesis of large-scale systems which also all...