Sciweavers

711 search results - page 87 / 143
» Optimal placement by branch-and-price
Sort
View
STOC
1995
ACM
145views Algorithms» more  STOC 1995»
13 years 11 months ago
Polynomial time approximation schemes for dense instances of NP-hard problems
We present a unified framework for designing polynomial time approximation schemes (PTASs) for “dense” instances of many NP-hard optimization problems, including maximum cut,...
Sanjeev Arora, David R. Karger, Marek Karpinski
LISA
2001
13 years 9 months ago
Macroscopic Internet Topology and Performance Measurements from the DNS Root Name Servers
We describe active measurements of topology and end-to-end latency characteristics between several of the DNS root servers and a subset of their clients using the skitter tool dev...
Marina Fomenkov, Kimberly C. Claffy, Bradley Huffa...
ICCAD
2005
IEEE
83views Hardware» more  ICCAD 2005»
14 years 4 months ago
Post-placement rewiring and rebuffering by exhaustive search for functional symmetries
Separate optimizations of logic and layout have been thoroughly studied in the past and are well documented for common benchmarks. However, to be competitive, modern circuit optim...
Kai-Hui Chang, Igor L. Markov, Valeria Bertacco
GECCO
2004
Springer
14 years 1 months ago
Crossover, Population Dynamics, and Convergence in the GAuGE System
This paper presents a study of the effectiveness of a recently presented crossover operator for the GAuGE system. This crossover, unlike the traditional crossover employed previou...
Miguel Nicolau, Conor Ryan
ICCAD
2000
IEEE
99views Hardware» more  ICCAD 2000»
14 years 8 days ago
Potential Slack: An Effective Metric of Combinational Circuit Performance
This paper proposes the concept of potential slack and show it is an effective metric of combinational circuit performance. We provide several methods for estimating potential sla...
Chunhong Chen, Xiaojian Yang, Majid Sarrafzadeh