975 search results - page 16 / 195 » Locality Optimization for Program Instances |
CP
2010
Springer
14 years 7 months ago
2010
Springer
We introduce a parallelized version of tree-decomposition based dynamic programming for solving difficult weighted CSP instances on many cores. A tree decomposition organizes cost ...
ESA
2006
Springer
15 years 1 months ago
2006
Springer
A popular approach in combinatorial optimization is to model problems as integer linear programs. Ideally, the relaxed linear program would have only integer solutions, which happ...
88
Voted
BMEI
2008
IEEE
15 years 4 months ago
2008
IEEE
Multiple sequence alignment is the most fundamental task in bioinformatics and computational biology. In this paper, we present a new algorithm to conduct multiple sequences align...
KBSE
2005
IEEE
15 years 3 months ago
2005
IEEE
Localizing the cause(s) of an observable error lies at the heart of program debugging. Fault localization often proceeds by comparing the failing program run with some “successf...
AIPS
2006
14 years 11 months ago
2006
This paper presents three techniques for using an iterated local search algorithm to improve the performance of a state-of-the-art branch and bound algorithm for job shop scheduli...