Sciweavers

673 search results - page 78 / 135
» Preference-Based Problem Solving for Constraint Programming
Sort
View
122
Voted
CVPR
2007
IEEE
15 years 8 months ago
A Graph Reduction Method for 2D Snake Problems
Energy-minimizing active contour models (snakes) have been proposed for solving many computer vision problems such as object segmentation, surface reconstruction, and object track...
Jianhua Yan, Keqi Zhang, Chengcui Zhang, Shu-Ching...
132
Voted
GECCO
2010
Springer
211views Optimization» more  GECCO 2010»
15 years 3 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...
225
Voted
CP
2009
Springer
16 years 2 months ago
Asynchronous Inter-Level Forward-Checking for DisCSPs
We propose two new asynchronous algorithms for solving Distributed Constraint Satisfaction Problems (DisCSPs). The first algorithm, AFC-ng, is a nogood-based version of Asynchronou...
Redouane Ezzahir, Christian Bessiere, Mohamed Wahb...
123
Voted
JFPLC
2001
15 years 3 months ago
Recherche adaptative et contraintes musicales
We propose an environment for musical constraint solving, in the visual programming language OpenMusic. We describe an implementation of a local search algorithm, called adaptive s...
Charlotte Truchet, Carlos Agon, Gérard Assa...
137
Voted
MP
2010
128views more  MP 2010»
15 years 18 days ago
Perspective reformulations of mixed integer nonlinear programs with indicator variables
Abstract. We study mixed integer nonlinear programs (MINLP)s that are driven by a collection of indicator variables where each indicator variable controls a subset of the decision ...
Oktay Günlük, Jeff Linderoth