Sciweavers

13376 search results - page 389 / 2676
» Problem Solving with
Sort
View
AAAI
1994
15 years 6 months ago
Solution Reuse in Dynamic Constraint Satisfaction Problems
Many AI problems can be modeled as constraint satisfaction problems (CSP), but many of them are actually dynamic: the set of constraints to consider evolves because of the environ...
Gérard Verfaillie, Thomas Schiex
GECCO
2010
Springer
211views Optimization» more  GECCO 2010»
15 years 5 months ago
Investigating EA solutions for approximate KKT conditions in smooth problems
Evolutionary algorithms (EAs) are increasingly being applied to solve real-parameter optimization problems due to their flexibility in handling complexities such as non-convexity,...
Rupesh Tulshyan, Ramnik Arora, Kalyanmoy Deb, Joyd...
167
Voted
SAT
2010
Springer
172views Hardware» more  SAT 2010»
15 years 3 months ago
On the Relative Merits of Simple Local Search Methods for the MAX-SAT Problem
Algorithms based on local search are popular for solving many optimization problems including the maximum satisfiability problem (MAXSAT). With regard to MAXSAT, the state of the ...
Denis Pankratov, Allan Borodin
CORR
2011
Springer
220views Education» more  CORR 2011»
14 years 11 months ago
On a linear programming approach to the discrete Willmore boundary value problem and generalizations
We consider the problem of finding (possibly non connected) discrete surfaces spanning a finite set of discrete boundary curves in the three-dimensional space and minimizing (glo...
Thomas Schoenemann, Simon Masnou, Daniel Cremers
146
Voted
DAGM
2010
Springer
15 years 5 months ago
Uncertainty Driven Multi-scale Optimization
This paper proposes a new multi-scale energy minimization algorithm which can be used to efficiently solve large scale labelling problems in computer vision. The basic modus operan...
Pushmeet Kohli, Victor S. Lempitsky, Carsten Rothe...