Sciweavers

2109 search results - page 15 / 422
» Solving Necklace Constraint Problems
Sort
View
117
Voted
IDA
2005
Springer
15 years 7 months ago
Miner Ants Colony: A New Approach to Solve a Mine Planning Problem
In this paper we introduce a simple ant based algorithm for solving a copper mine planning problem. In the last 10 years this realworld problem has been tackled using linear intege...
María-Cristina Riff, Michael Moossen, Xavie...
184
Voted
IJIT
2004
15 years 3 months ago
An Evolutionary Algorithm to Solve Cryptarithmetic Problem
Cryptarithmetic problem is an interesting constraint satisfaction problem for which different algorithms have been given. But none of them can solve the problem intelligently using...
Abu Sayef Md. Ishaque, Md. Bahlul Haider, Muhammad...
GECCO
2008
Springer
148views Optimization» more  GECCO 2008»
15 years 2 months ago
Solving constrained multi-objective problems by objective space analysis
In this paper a new approach to solve constrained multi-objective problems by way of evolutionary multi-objective optimization is introduced. In contrast to former evolutionary ap...
Gideon Avigad, Carlos A. Coello Coello
101
Voted
ECAI
2000
Springer
15 years 6 months ago
Extensions of Constraint Solving for Proof Planning
The integration of constraint solvers into proof planning has pushed the problem solving horizon. Proof planning benefits from the general functionalities of a constraint solver s...
Erica Melis, Jürgen Zimmer, Tobias Mülle...
112
Voted
CSCLP
2006
Springer
15 years 5 months ago
Bipolar Preference Problems: Framework, Properties and Solving Techniques
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 seemin...
Stefano Bistarelli, Maria Silvia Pini, Francesca R...