Sciweavers

3907 search results - page 97 / 782
» Time, Knowledge, and Choice
Sort
View
AIPS
2006
15 years 5 months ago
Combining Knowledge Compilation and Search for Conformant Probabilistic Planning
We present a new algorithm for conformant probabilistic planning, which for a given horizon produces a plan that maximizes the probability of success under quantified uncertainty ...
Jinbo Huang
ALT
2008
Springer
16 years 1 months ago
A Uniform Lower Error Bound for Half-Space Learning
Abstract. We give a lower bound for the error of any unitarily invariant algorithm learning half-spaces against the uniform or related distributions on the unit sphere. The bound i...
Andreas Maurer, Massimiliano Pontil
SEMWEB
2009
Springer
15 years 11 months ago
Mechanisms for Importing Modules
Abstract The current OWL 2 specification provides mechanisms for importing whole ontologies. This paper discusses the import of only a module of an external ontology, which is spe...
Bijan Parsia, Ulrike Sattler, Thomas Schneider
FOSSACS
2005
Springer
15 years 10 months ago
Axiomatizations for Probabilistic Finite-State Behaviors
Abstract. We study a process calculus which combines both nondeterministic and probabilistic behavior in the style of Segala and Lynch’s probabilistic automata. We consider vario...
Yuxin Deng, Catuscia Palamidessi
AI
2000
Springer
15 years 8 months ago
Learning Rewrite Rules versus Search Control Rules to Improve Plan Quality
Domain independent planners can produce better-quality plans through the use of domain-speci c knowledge, typically encoded as search control rules. The planning-by-rewriting appro...
Muhammad Afzal Upal, Renee Elio