Sciweavers

Share
AIPS
2008
9 years 18 days ago
Unifying the Causal Graph and Additive Heuristics
Many current heuristics for domain-independent planning, such as Bonet and Geffner's additive heuristic and Hoffmann and Nebel's FF heuristic, are based on delete relaxa...
Malte Helmert, Hector Geffner
AIPS
2008
9 years 18 days ago
Additive-Disjunctive Heuristics for Optimal Planning
The development of informative, admissible heuristics for cost-optimal planning remains a significant challenge in domain-independent planning research. Two techniques are commonl...
Andrew Coles, Maria Fox, Derek Long, Amanda Smith
AIPS
2007
9 years 18 days ago
Towards a Heuristic for Scheduling the James Webb Space Telescope
Scheduling the James Webb Space Telescope (JWST) requires modeling and minimizing the buildup of angular momentum of the spacecraft. Accounting for momentum management is expected...
Mark E. Giuliano, Reiko Rager, Nazma Ferdous
AAAI
2008
9 years 18 days ago
How Good is Almost Perfect?
Heuristic search using algorithms such as A and IDA is the prevalent method for obtaining optimal sequential solutions for classical planning tasks. Theoretical analyses of these ...
Malte Helmert, Gabriele Röger
AAAI
2007
9 years 18 days ago
Combining Multiple Heuristics Online
We present black-box techniques for learning how to interleave the execution of multiple heuristics in order to improve average-case performance. In our model, a user is given a s...
Matthew J. Streeter, Daniel Golovin, Stephen F. Sm...
CP
1995
Springer
9 years 1 months ago
Optimization-based Heuristics for Maximal Constraint Satisfaction
We present a new heuristic approach for maximal constraint satisfaction of overconstrained problems (MAX-CSP). This approach is based on a formulation of CSP as an optimization pro...
Javier Larrosa, Pedro Meseguer
RTA
2010
Springer
9 years 1 months ago
Automated Confluence Proof by Decreasing Diagrams based on Rule-Labelling
Decreasing diagrams technique (van Oostrom, 1994) is a technique that can be widely applied to prove confluence of rewrite systems. To directly apply the decreasing diagrams techn...
Takahito Aoto
DATE
2004
IEEE
147views Hardware» more  DATE 2004»
9 years 2 months ago
Automatic Tuning of Two-Level Caches to Embedded Applications
The power consumed by the memory hierarchy of a microprocessor can contribute to as much as 50% of the total microprocessor system power, and is thus a good candidate for optimiza...
Ann Gordon-Ross, Frank Vahid, Nikil Dutt
CNSR
2004
IEEE
153views Communications» more  CNSR 2004»
9 years 2 months ago
Improving the Referrer-Based Web Log Session Reconstruction
In this paper we discuss the kinds of ambiguities a heuristic encounters during the process of user session reconstruction. Some criteria are introduced to measure these ambiguiti...
Mehran Nadjarbashi-Noghani, Ali A. Ghorbani
AINA
2004
IEEE
9 years 2 months ago
On the Performance of Heuristic H MCOP for Multi-Constrained Optimal-Path QoS Routing
Network services for finding a feasible or an optimal path subject to multiple constraints on performance metrics such as delay, jitter, loss probability, etc. give rise to multip...
Gang Feng
books