1971 search results - page 53 / 395 » Tabu search - Uncharted domains |
JAIR
2007
14 years 9 months ago
2007
Most classical scheduling formulations assume a fixed and known duration for each activity. In this paper, we weaken this assumption, requiring instead that each duration can be ...
65
Voted
AIR
2004
14 years 9 months ago
2004
Abstract. In this work we study an over-constrained scheduling problem where constraints cannot be relaxed. This problem originates from a local defense agency where activities to ...
TEC
2002
14 years 9 months ago
2002
An ant colony optimization (ACO) approach for the resource-constrained project scheduling problem (RCPSP) is presented. Several new features that are interesting for ACO in general...
77
Voted
NETWORKS
2010
14 years 8 months ago
2010
Let G = (V, E, Q) be a undirected graph, where V is the set of vertices, E is the set of edges, and Q = {Q1, . . . , Qq} is a partition of V into q subsets. We refer to Q1, . . . ...
CIBCB
2006
IEEE
15 years 3 months ago
2006
IEEE
The vast number of expressed sequence tags (ESTs) in public databases provides an important resource for comparative and functional genomics. A variety of methods based on homology...