Sciweavers

660 search results - page 36 / 132
» Hybrid CSP Solving
Sort
View
AAAI
1994
13 years 11 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
2008
Springer
238views Optimization» more  GECCO 2008»
13 years 11 months ago
Using multiple offspring sampling to guide genetic algorithms to solve permutation problems
The correct choice of an evolutionary algorithm, a genetic representation for the problem being solved (as well as their associated variation operators) and the appropriate values...
Antonio LaTorre, José Manuel Peña, V...
MICAI
2007
Springer
14 years 4 months ago
Hybrid Evolutionary Algorithm for Flowtime Minimisation in No-Wait Flowshop Scheduling
This research presents a novel approach to solve m-machine no-wait flowshop scheduling problem. A continuous flowshop problem with total flowtime as criterion is considered appl...
Geraldo Ribeiro Filho, Marcelo Seido Nagano, Luiz ...
CP
1998
Springer
14 years 2 months ago
Optimizing with Constraints: A Case Study in Scheduling Maintenance of Electric Power Units
A well-studied problem in the electric power industry is that of optimally scheduling preventative maintenance of power generating units within a power plant. We show how these pr...
Daniel Frost, Rina Dechter
CCGRID
2007
IEEE
14 years 1 months ago
A Hybrid Linear Programming and Evolutionary Algorithm based Approach for On-line Resource Matching in Grid Environments
We describe a hybrid linear programming (LP) and evolutionary algorithm (EA) based resource matcher suitable for heterogeneous grid environments. The hybrid matcher adopts the ite...
Pawel Garbacki, Vijay K. Naik