197 search results - page 21 / 40 » Optimizing Chemotherapy Scheduling Using Local Search Heuris... |
105
click to vote
IPPS
2006
IEEE
15 years 8 months ago
2006
IEEE
We present a SAT-based approach to the task and message allocation problem of distributed real-time systems with hierarchical architectures. In contrast to the heuristic approache...
146
Voted
TEC
2002
15 years 1 months ago
2002
In this paper, we describe a new incomplete approach for solving constraint satisfaction problems (CSPs) based on the ant colony optimization (ACO) metaheuristic. The idea is to us...
115
click to vote
AAAI
2004
15 years 3 months ago
2004
Oversubscribed scheduling problems require removing or partially satisfying tasks when enough resources are not available. For a particular oversubscribed problem, Air Force Satel...
112
Voted
AE
2005
Springer
15 years 7 months ago
2005
Springer
This paper presents a new Memetic Algorithm designed to compute near optimal solutions for the MinLA problem. It incorporates a highly specialized crossover operator, a fast MinLA ...
112
click to vote
CP
2005
Springer
15 years 7 months ago
2005
Springer
Abstract. Multi-Point Constructive Search maintains a small set of “elite solutions” that are used to heuristically guide constructive search through periodically restarting se...