908 search results - page 40 / 182 » Heuristic Methods for Solving Job-Shop Scheduling Problems |
102
click to vote
GECCO
2010
Springer
15 years 6 months ago
2010
Springer
The Spidergon interconnection network has become popular recently in multiprocessor systems on chips. To the best of our knowledge, algorithms for collective communications (CC) h...
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...
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...
110
click to vote
GECCO
2008
Springer
15 years 3 months ago
2008
Springer
Scheduling collective communications (CC) in networks based on optimal graphs and digraphs has been done with the use of the evolutionary techniques. Inter-node communication patt...
149
click to vote
AAAI
1994
15 years 3 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...