706 search results - page 128 / 142 » Super Solutions in Constraint Programming |
VLDB
2001
ACM
15 years 4 months ago
2001
ACM
Cleaning data of errors in structure and content is important for data warehousing and integration. Current solutions for data cleaning involve many iterations of data “auditing...
ICRA
1998
IEEE
15 years 3 months ago
1998
IEEE
Abstract--Manufacturing scheduling is an important but difficult task. In order to effectively solve such combinatorial optimization problems, this paper presents a novel Lagrangia...
102
click to vote
GLVLSI
1996
IEEE
15 years 3 months ago
1996
IEEE
In this paper, we propose a global routing algorithm for multi-layer building-block layouts. The algorithm is based on successive ripup and rerouting while satisfying edge capacit...
DAC
2009
ACM
15 years 3 months ago
2009
ACM
Structured ASICs have recently emerged as an exciting alternative to ASIC or FPGA design style as they provide a new trade-off between the high performance of ASIC design and low ...
82
Voted
STOC
1995
ACM
15 years 3 months ago
1995
ACM
We present a unified framework for designing polynomial time approximation schemes (PTASs) for “dense” instances of many NP-hard optimization problems, including maximum cut,...