442 search results - page 21 / 89 » Discovering Heuristic Strategy for Solving Scheduling Proble... |
114
Voted
IJCAI
1989
15 years 3 months ago
1989
Cognitive architectures aspire for generality both in terms of problem solving and learning across a range of problems, yet to date few examples of domain independent learning has...
112
click to vote
CSCLP
2006
Springer
15 years 5 months ago
2006
Springer
Abstract. In this paper we present a novel approach to solving Constraint Satisfaction Problems whose constraint graphs are highly clustered and the graph of clusters is close to b...
95
Voted
CORR
2008
Springer
15 years 2 months ago
2008
Springer
During our earlier research, it was recognised that in order to be successful with an indirect genetic algorithm approach using a decoder, the decoder has to strike a balance betw...
116
click to vote
GECCO
2007
Springer
15 years 8 months ago
2007
Springer
In this paper, a novel discrete differential evolution (DDE) algorithm is presented to solve the permutation flowhop scheduling problem with the makespan criterion. The DDE algori...
130
click to vote
PDP
2003
IEEE
15 years 7 months ago
2003
IEEE
We consider the execution of a complex application on a heterogeneous "grid" computing platform. The complex application consists of a suite of identical, independent pr...