Sciweavers

INFORMATICALT
2002
91views more  INFORMATICALT 2002»
13 years 11 months ago
Bayesian Heuristic Approach to Scheduling
Abstract. Real life scheduling problems are solved by heuristics with parameters defined by experts, as usual. In this paper a new approach is proposed where the parameters of vari...
Jonas Mockus
CONSTRAINTS
1998
62views more  CONSTRAINTS 1998»
13 years 11 months ago
Learning Game-Specific Spatially-Oriented Heuristics
This paper describes an architecture that begins with enough general knowledge to play any board game as a novice, and then shifts its decision-making emphasis to learned, game-sp...
Susan L. Epstein, Jack Gelfand, Esther Lock
CI
1998
78views more  CI 1998»
13 years 11 months ago
Pattern Databases
A pattern database is a lookup table that stores an exact evaluation function for a relaxed search problem, which provides an admissible heuristic for the original search problem....
Joseph C. Culberson, Jonathan Schaeffer
HEURISTICS
2002
152views more  HEURISTICS 2002»
13 years 11 months ago
A Constraint-Based Method for Project Scheduling with Time Windows
This paper presents a heuristic algorithm for solving RCPSP/max, the resource constrained project scheduling problem with generalized precedence relations. The algorithm relies, a...
Amedeo Cesta, Angelo Oddi, Stephen F. Smith
CORR
2007
Springer
144views Education» more  CORR 2007»
13 years 11 months ago
Heuristics for Network Coding in Wireless Networks
Multicast is a central challenge for emerging multi-hop wireless architectures such as wireless mesh networks, because of its substantial cost in terms of bandwidth. In this artic...
Song Yean Cho, Cedric Adjih, Philippe Jacquet
COR
2002
58views more  COR 2002»
13 years 11 months ago
Fast heuristics for large scale covering-location problems
We propose fast heuristics for large-scale covering-location problems in which the set of demand points is discrete and the set of potential location sites is continuous. These he...
Luce Brotcorne, Gilbert Laporte, Fréd&eacut...
CLASSIFICATION
2004
59views more  CLASSIFICATION 2004»
13 years 11 months ago
Oscillation Heuristics for the Two-group Classification Problem
: We propose a new nonparametric family of oscillation heuristics for improving linear classifiers in the two-group discriminant problem. The heuristics are motivated by the intuit...
Ognian Asparouhov, Paul A. Rubin
KER
2007
90views more  KER 2007»
13 years 11 months ago
PLTOOL: A knowledge engineering tool for planning and learning
AI planning solves the problem of generating a correct and efficient ordered set of instantiated activities, from a knowledge base of generic actions, which when executed will tra...
Susana Fernández, Daniel Borrajo, Raquel Fu...
TPDS
2008
64views more  TPDS 2008»
13 years 11 months ago
Linear Programming-Based Affinity Scheduling of Independent Tasks on Heterogeneous Computing Systems
Abstract-- Resource management systems (RMS) are an important component in heterogeneous computing (HC) systems. One of the jobs of an RMS is the mapping of arriving tasks onto the...
Issam Al-Azzoni, Douglas G. Down
BMCBI
2005
158views more  BMCBI 2005»
13 years 11 months ago
Automated generation of heuristics for biological sequence comparison
Background: Exhaustive methods of sequence alignment are accurate but slow, whereas heuristic approaches run quickly, but their complexity makes them more difficult to implement. ...
Guy St. C. Slater, Ewan Birney