660 search results - page 36 / 132 » Hybrid CSP Solving |
160
Voted
AAAI
1994
15 years 5 months ago
1994
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...
137
Voted
GECCO
2008
Springer
15 years 4 months ago
2008
Springer
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...
132
click to vote
MICAI
2007
Springer
15 years 9 months ago
2007
Springer
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...
124
Voted
CP
1998
Springer
15 years 7 months ago
1998
Springer
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...
150
Voted
CCGRID
2007
IEEE
15 years 7 months ago
2007
IEEE
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...