Sciweavers

190 search results - page 26 / 38
» Improving the Held and Karp Approach with Constraint Program...
Sort
View
CONSTRAINTS
2011
13 years 2 months ago
Solving Steel Mill Slab Problems with constraint-based techniques: CP, LNS, and CBLS
The Steel Mill Slab Problem is an optimization benchmark that has been studied for a long time in the constraint-programming community but was only solved efficiently in the two l...
Pierre Schaus, Pascal Van Hentenryck, Jean-Noë...
CP
2003
Springer
14 years 25 days ago
Solving Max-SAT as Weighted CSP
For the last ten years, a significant amount of work in the constraint community has been devoted to the improvement of complete methods for solving soft constraints networks. We ...
Simon de Givry, Javier Larrosa, Pedro Meseguer, Th...
CP
2005
Springer
14 years 1 months ago
Tree Decomposition with Function Filtering
Besides search, complete inference methods can also be used to solve soft constraint problems. Their main drawback is the high spatial complexity. To improve its practical usage, w...
Martí Sánchez, Javier Larrosa, Pedro...
ISSTA
2006
ACM
14 years 1 months ago
Path-oriented random testing
Test campaigns usually require only a restricted subset of paths in a program to be thoroughly tested. As random testing (RT) offers interesting fault-detection capacities at low ...
Arnaud Gotlieb, Matthieu Petit
ALMOB
2006
106views more  ALMOB 2006»
13 years 7 months ago
Multiple sequence alignment with user-defined anchor points
Background: Automated software tools for multiple alignment often fail to produce biologically meaningful results. In such situations, expert knowledge can help to improve the qua...
Burkhard Morgenstern, Sonja J. Prohaska, Dirk P&ou...