908 search results - page 148 / 182 » Heuristic Methods for Solving Job-Shop Scheduling Problems |
106
click to vote
DAGSTUHL
2004
15 years 3 months ago
2004
Complexity is the core problem of contemporary information technology, as the "artificial complicatedness" of its artefacts is exploding. Intellectually easy and economic...
100
click to vote
KCAP
2005
ACM
15 years 7 months ago
2005
ACM
Effective reuse of Knowledge Bases (KBs) often entails the expensive task of identifying plausible KB-PS (Problem Solver) combinations. We propose a novel technique based on Const...
113
click to vote
GECCO
2007
Springer
15 years 8 months ago
2007
Springer
In this paper we propose an agent-based model of evolutionary algorithms (EAs) which extends seamlessly from concurrent single-host to distributed multi-host installations. Since ...
148
click to vote
GECCO
2009
Springer
15 years 8 months ago
2009
Springer
The bounded diameter minimum spanning tree problem is an NP-hard combinatorial optimization problem arising, for example, in network design when quality of service is of concern. ...
118
click to vote
IROS
2007
IEEE
15 years 8 months ago
2007
IEEE
– A problem of searching with multiple searchers and scouts is presented. Unlike most search problems that terminate as soon as the target is found, successful detections by scou...