693 search results - page 18 / 139 » Complexity Analysis of Heuristic CSP Search Algorithms |
139
Voted
CONSTRAINTS
2010
15 years 1 months ago
2010
Abstract. We describe a simple CSP formalism for handling multi-attribute preference problems with hard constraints, one that combines hard constraints and preferences so the two a...
ICC
2007
IEEE
15 years 8 months ago
2007
IEEE
—The full-complexity soft-input/soft-output (SISO) multiuser detector based on the a posteriori probability (APP) algorithm has a computational complexity growing exponentially w...
115
click to vote
AAAI
1998
15 years 3 months ago
1998
One of the surprising findings from the study of CNF satisfiability in the 1990's has been the success of iterative repair techniques, and in particular of weighted iterative...
108
click to vote
EOR
2010
15 years 1 months ago
2010
This study investigates an optimization-based heuristic for the Robotic Cell Problem. This problem arises in automated cells and is a complex ow shop problem with a single transpo...
202
click to vote
CP
2009
Springer
16 years 2 months ago
2009
Springer
The Valued Constraint Satisfaction Problem (VCSP) is a general framework encompassing many optimisation problems. We discuss precisely what it means for a problem to be modelled in...