Sciweavers

Share
CCR
2008
84views more  CCR 2008»
8 years 10 months ago
Cold topics in networking
A major contribution to global warming has been the number of new workshops publishing proceedings with the prefix hot. In this article, I propose that we counter this trend in an...
Jon Crowcroft
BMCBI
2010
95views more  BMCBI 2010»
8 years 10 months ago
Heuristics for the inversion median problem
Background: The study of genome rearrangements has become a mainstay of phylogenetics and comparative genomics. Fundamental in such a study is the median problem: given three geno...
Vaibhav Rajan, Andrew Wei Xu, Yu Lin, Krister M. S...
EUROPAR
2010
Springer
8 years 11 months ago
Non-clairvoyant Scheduling of Multiple Bag-of-Tasks Applications
The bag-of-tasks application model, albeit simple, arises in many application domains and has received a lot of attention in the scheduling literature. Previous works propose eithe...
Henri Casanova, Matthieu Gallet, Fréd&eacut...
CEC
2010
IEEE
8 years 11 months ago
Providing a memory mechanism to enhance the evolutionary design of heuristics
Genetic programming approaches have previously been employed in the literature to evolve heuristics for various combinatorial optimisation problems. This paper presents a hyper-heu...
Edmund K. Burke, Matthew R. Hyde, Graham Kendall
AIPS
2009
8 years 11 months ago
Preferred Operators and Deferred Evaluation in Satisficing Planning
Heuristic forward search is the dominant approach to satisficing planning to date. Most successful planning systems, however, go beyond plain heuristic search by employing various...
Silvia Richter, Malte Helmert
IJCAI
1997
8 years 11 months ago
Automatic Generation of Heuristics for Scheduling
This paper presents a technique, called GENH, that automatically generates search heuristics for scheduling problems. The impetus for developing this technique is the growing cons...
Robert A. Morris, John L. Bresina, Stuart M. Rodge...
PUK
2000
8 years 11 months ago
Heuristic Search Planning with BDDs
Abstract. In this paper we study traditional and enhanced BDDbased exploration procedures capable of handling large planning problems. On the one hand, reachability analysis and mo...
Stefan Edelkamp
CIC
2004
118views Communications» more  CIC 2004»
8 years 11 months ago
An Efficient Delay Sensitive Multicast Routing Algorithm
As a key issue in multicast routing with quality of service (QoS) support, constrained minimum Steiner tree (CMST) problem has been a research focus for more than a decade, and ten...
Gang Feng
AIPS
2004
8 years 11 months ago
A Lookahead Strategy for Heuristic Search Planning
The planning as heuristic search framework, initiated by the planners ASP from Bonet, Loerincs and Geffner, and HSP from Bonet and Geffner, lead to some of the most performant pla...
Vincent Vidal
AIPS
2004
8 years 11 months ago
An Empirical Analysis of Some Heuristic Features for Local Search in LPG
LPG is a planner that performed very well in the last International planning competition (2002). The system is based on a stochastic local search procedure, and it incorporates se...
Alfonso Gerevini, Alessandro Saetti, Ivan Serina
books