Sciweavers

2109 search results - page 19 / 422
» Solving Necklace Constraint Problems
Sort
View
JETAI
2010
115views more  JETAI 2010»
15 years 10 days ago
From soft constraints to bipolar preferences: modelling framework and solving issues
Real-life problems present several kinds of preferences. We focus on problems with both positive and negative preferences, that we call bipolar preference problems. Although seemi...
Stefano Bistarelli, Maria Silvia Pini, Francesca R...
JAIR
2010
99views more  JAIR 2010»
15 years 10 days ago
Developing Approaches for Solving a Telecommunications Feature Subscription Problem
Call control features (e.g., call-divert, voice-mail) are primitive options to which users can subscribe off-line to personalise their service. The configuration of a feature su...
David Lesaint, Deepak Mehta, Barry O'Sullivan, Lui...
IJCGA
2006
79views more  IJCGA 2006»
15 years 1 months ago
Well-constrained Completion and Decomposition for under-constrained Geometric Constraint Problems
In this paper, we consider the optimal well-constrained completion problem, that is, for an under-constrained geometric constraint problem, add automatically new constraints in suc...
Gui-Fang Zhang, Xiao-Shan Gao
WSC
2004
15 years 3 months ago
Solving Stochastic Mathematical Programs with Complementarity Constraints Using Simulation
Recently, simulation-based methods have been successfully used for solving challenging stochastic optimization problems and equilibrium models. Here we report some of the recent p...
S. Ilker Birbil, Gül Gürkan, Ovidiu List...
CP
2005
Springer
15 years 7 months ago
Using Constraint Programming for Solving Distance CSP with Uncertainty
Many problems in chemistry, robotics or molecular biology can be expressed as a Distance CSP4 . In this paper, we propose a specific methodology for tackling uncertainties in this...
Carlos Grandón, Bertrand Neveu