Sciweavers

478 search results - page 10 / 96
» Local Search for Computing Normal Circumstances Models
Sort
View
IWPEC
2009
Springer
14 years 5 months ago
Stable Assignment with Couples: Parameterized Complexity and Local Search
We study the Hospitals/Residents with Couples problem, a variant of the classical Stable Marriage problem. This is the extension of the Hospitals/Residents problem where residents ...
Dániel Marx, Ildikó Schlotter
AAAI
2006
13 years 11 months ago
Local-Search Techniques for Boolean Combinations of Pseudo-Boolean Constraints
Some search problems are most directly specified by boolean combinations of pseudo-boolean constraints. We study a logic PL(PB) whose formulas are of this form, and design local-s...
Lengning Liu, Miroslaw Truszczynski
CONSTRAINTS
2007
112views more  CONSTRAINTS 2007»
13 years 10 months ago
Maxx: Test Pattern Optimisation with Local Search Over an Extended Logic
In the ECAD area, the Test Generation (TG) problem consists in finding an input vector test for some possible diagnosis (a set of faults) of a digital circuit. Such tests may have ...
Francisco Azevedo
CP
2006
Springer
14 years 2 months ago
Distributed Constraint-Based Local Search
Distributed computing is increasingly important at a time when the doubling of the number of transistors on a processor every 18 months no longer translates in a doubling of speed ...
Laurent Michel, Andrew See, Pascal Van Hentenryck
CPAIOR
2004
Springer
14 years 3 months ago
Scheduling Abstractions for Local Search
ng Abstractions for Local Search Pascal Van Hentenryck1 and Laurent Michel2 1 Brown University, Box 1910, Providence, RI 02912 2 University of Connecticut, Storrs, CT 06269-3155 Ab...
Pascal Van Hentenryck, Laurent Michel