This paper shows that the performance of peer-to-peer resource discovery algorithms is upper bounded by a k-Steiner minimum tree and proposes an algorithm locating near-optimal qu...
Mikko Vapa, Annemari Auvinen, Yevgeniy Ivanchenko,...
Relaxed plans are used in the heuristic search planner FF for computing a numerical heuristic and extracting helpful actions. We present a novel way for extracting information fro...
— We present heuristic algorithms for pruning large sets of candidate paths or trajectories down to smaller subsets that maintain desirable characteristics in terms of overall re...
Michael S. Branicky, Ross A. Knepper, James J. Kuf...
Abstract. The purpose of this paper is (1) to provide a theoretical justification for the use of Monte-Carlo sampling for approximate resolution of NP-hard maximization problems in...
— A hyperheuristic is a high level problem solving methodology that performs a search over the space generated by a set of low level heuristics. One of the hyperheuristic framewo...