Sciweavers

3808 search results - page 385 / 762
» Artificial Intelligence: A Modern Approach
Sort
View
AIPS
2009
15 years 8 months ago
Computing Robust Plans in Continuous Domains
We define the robustness of a sequential plan as the probability that it will execute successfully despite uncertainty in the execution environment. We consider a rich notion of u...
Christian Fritz, Sheila A. McIlraith
CEC
2010
IEEE
15 years 8 months ago
Generating a novel sort algorithm using Reinforcement Programming
Abstract-- Reinforcement Programming (RP) is a new approach to automatically generating algorithms, that uses reinforcement learning techniques. This paper describes the RP approac...
Spencer K. White, Tony R. Martinez, George L. Rudo...
ECAI
2010
Springer
15 years 8 months ago
Sound and Complete Landmarks for And/Or Graphs
Landmarks for a planning problem are subgoals that are necessarily made true at some point in the execution of any plan. Since verifying that a fact is a landmark is PSPACE-complet...
Emil Keyder, Silvia Richter, Malte Helmert
ECAI
2010
Springer
15 years 8 months ago
Learning Aggregation Functions for Expert Search
Abstract. Machine learning techniques are increasingly being applied to problems in the domain of information retrieval and text mining. In this paper we present an application of ...
Ronan Cummins, Mounia Lalmas, Colm O'Riordan
ECAI
2010
Springer
15 years 8 months ago
Learning action effects in partially observable domains
We investigate the problem of learning action effects in partially observable STRIPS planning domains. Our approach is based on a voted kernel perceptron learning model, where act...
Kira Mourão, Ronald P. A. Petrick, Mark Ste...