944 search results - page 40 / 189 » Heuristic Search for Large Problems With Real Costs |
GECCO
2009
Springer
15 years 4 months ago
2009
Springer
Hyper-heuristics (HHs) are heuristics that work with an arbitrary set of search operators or algorithms and combine these algorithms adaptively to achieve a better performance tha...
DAM
2000
14 years 9 months ago
2000
Feedback problems consist of removing a minimal number of vertices of a directed or undirected graph in order to make it acyclic. The problem is known to be NPcomplete. In this pa...
KDD
2008
ACM
15 years 10 months ago
2008
ACM
Supervised classification methods have been shown to be very effective for a large number of applications. They require a training data set whose instances are labeled to indicate...
JAIR
2006
14 years 9 months ago
2006
Fast Downward is a classical planning system based on heuristic search. It can deal with general deterministic planning problems encoded in the propositional fragment of PDDL2.2, ...
TPDS
2008
14 years 9 months ago
2008
It is anticipated that a large amount of multicast traffic needs to be supported in future communication networks. The network coding technique proposed recently is promising for e...