2244 search results - page 18 / 449 » A new heuristic approach for non-convex optimization problem... |
CAS
2008
13 years 7 months ago
2008
: Ant Colony Optimization (ACO) is a class of metaheuristic algorithms sharing the common approach of constructing a solution on the basis of information provided both by a standar...
AAAI
2007
13 years 9 months ago
2007
Various tasks in decision making and decision support require selecting a preferred subset of items from a given set of feasible items. Recent work in this area considered methods...
COCOA
2008
Springer
13 years 9 months ago
2008
Springer
Abstract: Recently, there have been significant theoretical progresses towards fixed-parameter algorithms for the DOMINATING SET problem of planar graphs. It is known that the prob...
WEA
2004
Springer
14 years 23 days ago
2004
Springer
Abstract. The maximum diversity problem (MDP) consists of identifying optimally diverse subsets of elements from some larger collection. The selection of elements is based on the d...
IJCAI
2003
13 years 8 months ago
2003
In this paper we consider the solution of scheduling problems that are inherently over-subscribed. In such problems, there are always more tasks to execute within a given time fra...