76 search results - page 4 / 16 » The Temporal Knapsack Problem and Its Solution |
IJAIT
2002
13 years 7 months ago
2002
Several real world applications involve solving combinatorial optimization problems. Commonly, existing heuristic approaches are designed to address specific difficulties of the u...
JPDC
2010
13 years 2 months ago
2010
We show a method for parallelizing top down dynamic programs in a straightforward way by a careful choice of a lock-free shared hash table implementation and randomization of the ...
EMO
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. This paper proposes an improved version of volume dominance to assign fitness to solutions in Pareto-based multi-objective optimisation. The impact of this revised volum...
AIPS
2003
13 years 9 months ago
2003
We describe the problem of scheduling observations for an airborne astronomical observatory. The problem incorporates complex constraints relating the feasibility of an astronomic...
CP
1995
Springer
13 years 11 months ago
1995
Springer
We present a method for finding optimal partial solutions to overconstrained instances of the Disjunctive Temporal Problems (DTP). The solutions are optimal in that they satisfy ...