4432 search results - page 162 / 887 » Solving Demodulation as an Optimization Problem |
136
click to vote
COMPGEOM
1998
ACM
15 years 7 months ago
1998
ACM
Abstract. We propose a simple, general, randomized technique to reduce certain geometric optimization problems to their corresponding decision problems. These reductions increase t...
159
Voted
CONSTRAINTS
2010
15 years 3 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...
134
Voted
PRICAI
2010
Springer
15 years 1 months ago
2010
Springer
Abstract. We consider the problem of computing optimal plans for propositional planning problems with action costs. In the spirit of leveraging advances in general-purpose automate...
131
click to vote
PG
2007
IEEE
15 years 9 months ago
2007
IEEE
We formulate contour correspondence as a Quadratic Assignment Problem (QAP), incorporating proximity information. By maintaining the neighborhood relation between points this way,...
119
Voted
PPDP
2005
Springer
15 years 9 months ago
2005
Springer
The paper describes a constraint-based solution to the protein folding problem on face-centered cubic lattices—a biologically meaningful approximation of the general protein fol...