1144 search results - page 144 / 229 » Logic programming for combinatorial problems |
139
click to vote
ICCAD
1999
IEEE
15 years 6 months ago
1999
IEEE
We consider the problem of finding an optimal clock schedule, i.e. optimal arrival times for clock signals at latches of a VLSI chip. We describe a general model which includes al...
133
click to vote
ICRA
1998
IEEE
15 years 6 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...
135
click to vote
APPROX
2008
Springer
15 years 4 months ago
2008
Springer
In the field of robust optimization, the goal is to provide solutions to combinatorial problems that hedge against variations of the numerical parameters. This constitutes an effor...
109
click to vote
BIOINFORMATICS
2007
15 years 2 months ago
2007
Primer approximation multiplex PCR (PAMP) is a new experimental protocol for efficiently assaying structural variation in genomes. PAMP is particularly suited to cancer genomes w...
128
click to vote
CORR
2008
Springer
15 years 2 months ago
2008
Springer
The measure and conquer approach has proven to be a powerful tool to analyse exact algorithms for combinatorial problems, like Dominating Set and Independent Set. In this paper, we...