Sciweavers

5 search results - page 1 / 1
» Optimal Additive Composition of Abstraction-based Admissible...
Sort
View
AIPS
2008
13 years 7 months 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
2008
13 years 7 months ago
Structural Patterns Heuristics via Fork Decomposition
We consider a generalization of the PDB homomorphism abstractions to what is called "structural patterns". The bais in abstracting the problem in hand into provably trac...
Michael Katz, Carmel Domshlak
AI
2002
Springer
13 years 4 months ago
Algorithm for optimal winner determination in combinatorial auctions
Combinatorial auctions, that is, auctions where bidders can bid on combinations of items, tend to lead to more efficient allocations than traditional auction mechanisms in multi-i...
Tuomas Sandholm
CGO
2011
IEEE
12 years 8 months ago
Language and compiler support for auto-tuning variable-accuracy algorithms
—Approximating ideal program outputs is a common technique for solving computationally difficult problems, for adhering to processing or timing constraints, and for performance ...
Jason Ansel, Yee Lok Wong, Cy P. Chan, Marek Olsze...