708 search results - page 63 / 142 » Timing closure: the solution and its problems |
127
click to vote
IJCAI
2001
15 years 7 months ago
2001
The algorithm presented here, BCC, is an enhancement of the well known Backtrack used to solve constraint satisfaction problems. Though most backtrack improvements rely on propaga...
135
click to vote
CEC
2010
IEEE
15 years 7 months ago
2010
IEEE
Based on the Proximate Optimality Principle in metaheuristics, a Population Based Guided Local Search (PGLS) framework for dealing with difficult combinatorial optimization problem...
157
click to vote
COR
2008
15 years 6 months ago
2008
In this paper, we provide a study of Max-Min Fair (MMF) multicommodity flows and focus on some of their applications to multi-commodity networks. We first present the theoretical ...
172
click to vote
FGCS
2008
15 years 6 months ago
2008
The advent of Grid environments made feasible the solution of computational intensive problems in a reliable and cost-effective way. As workflow systems carry out more complex and...
144
click to vote
DAC
2007
ACM
16 years 7 months ago
2007
ACM
With increasing time-to-market pressure and shortening semiconductor product cycles, more and more chips are being designed with library-based methodologies. In spite of this shif...