Back to Results
First PageMeta Content
FO / Finite model theory / Big O notation / Operator / Assignment / Modal logic / Linguistics / Logic / Mathematics / Mathematical notation


The Relative Pruning Power of Strong Stubborn Sets and Expansion Core Martin Wehrle and Malte Helmert ¨ Yusra Alkhazraji and Robert Mattmuller
Add to Reading List

Document Date: 2013-04-30 16:52:25

Open Document

File Size: 286,41 KB

Share Result on Facebook

Company

Concurrent Systems / Complex Systems / IOS Press / AMD / AAAI Press / /

/

Facility

University of Basel / Robert Mattmuller University of Basel / malte.helmert}@unibas.ch University of Freiburg / /

IndustryTerm

overall search algorithm / fixed-point algorithm / heuristic search / computing / earlier algorithm / explicit algorithm / pure heuristic search / search space / search algorithm / expansion core algorithm / /

Organization

Artificial Copyright Intelligence / Robert Mattmuller University of Basel / Association for the Advancement / Swiss National Science Foundation / University of Freiburg / /

Person

Gomes / Yusra Alkhazraji / CANA LYZER / /

Position

planner / /

Product

SATELLITE / /

ProgrammingLanguage

EC / /

PublishedMedium

Complex Systems / Journal of Artificial Intelligence Research / /

Technology

earlier algorithm / overall search algorithm / resulting algorithm / artificial intelligence / search algorithm / EC pruning algorithm / planning algorithms / fixed-point algorithm / explicit algorithm / /

URL

www.aaai.org / /

SocialTag