Sciweavers

346 search results - page 40 / 70
» Solving quantified constraint satisfaction problems
Sort
View
97
Voted
CONSTRAINTS
2002
107views more  CONSTRAINTS 2002»
15 years 9 days ago
Fourier Elimination for Compiling Constraint Hierarchies
Linear equality and inequality constraints arise naturally in specifying many aspects of user interfaces, such as requiring that one window be to the left of another, requiring tha...
Warwick Harvey, Peter J. Stuckey, Alan Borning
CP
2003
Springer
15 years 5 months ago
Open Constraint Optimization
Constraint satisfaction has been applied with great success in closed-world scenarios, where all options and constraints are known from the beginning and fixed. With the internet,...
Boi Faltings, Santiago Macho-Gonzalez
113
Voted
CORR
2010
Springer
124views Education» more  CORR 2010»
15 years 17 days ago
Symmetry within and between solutions
Symmetry can be used to help solve many problems. For instance, Einstein's famous 1905 paper ("On the Electrodynamics of Moving Bodies") uses symmetry to help derive...
Toby Walsh
ICDT
2010
ACM
141views Database» more  ICDT 2010»
15 years 4 months ago
The Complexity of Rooted Phylogeny problems
Several computational problems in phylogenetic reconstruction can be formulated as restrictions of the following general problem: given a formula in conjunctive normal form where ...
Manuel Bodirsky, Jens K. Mueller
106
Voted
EXPCS
2007
15 years 4 months ago
Performance testing of combinatorial solvers with isomorph class instances
Combinatorial optimization problems expressed as Boolean constraint satisfaction problems (BCSPs) arise in several contexts, ranging from the classical unate set-packing problems ...
Franc Brglez, Jason A. Osborne