Sciweavers

13376 search results - page 292 / 2676
» Problem Solving with
Sort
View
IJCAI
1989
15 years 5 months ago
Experimental Evaluation of Preprocessing Techniques in Constraint Satisfaction Problems
This paper presents an evaluation of two orthogonal schemes for improving the efficiency of solving constraint satisfaction problems (CSPs). The first scheme involves a class of p...
Rina Dechter, Itay Meiri
131
Voted
HIS
2009
15 years 1 months ago
A Particle Swarm Optimization with Feasibility-Based Rules for Mixed-Variable Optimization Problems
A Particle Swarm Optimization algorithm with feasibility-based rules (FRPSO) is proposed in this paper to solve mixed-variable optimization problems. An approach to handle various ...
Chao-Li Sun, Jian-Chao Zeng, Jeng-Shyang Pan
197
Voted
PROCEDIA
2011
14 years 6 months ago
Exact Closest String as a Constraint Satisfaction Problem
We report the first evaluation of Constraint Satisfaction as a computational framework for solving closest string problems. We show that careful consideration of symbol occurrenc...
Tom Kelsey, Lars Kotthoff
122
Voted
GECCO
2006
Springer
15 years 7 months ago
MOGE: GP classification problem decomposition using multi-objective optimization
A novel approach to classification is proposed in which a Paretobased ranking of individuals is used to encourage multiple individuals to participate in the solution. To do so, th...
Andrew R. McIntyre, Malcolm I. Heywood
150
Voted
UAI
1998
15 years 5 months ago
Flexible Decomposition Algorithms for Weakly Coupled Markov Decision Problems
This paper presents two new approaches to decomposing and solving large Markov decision problems (MDPs), a partial decoupling method and a complete decoupling method. In these app...
Ronald Parr