Sciweavers

210 search results - page 10 / 42
» Some Competition Programming Problems as the Beginning of Ar...
Sort
View
ECAI
2004
Springer
15 years 2 months ago
Planning with Numerical Expressions in LPG
Abstract. We present some techniques for handling planning problems with numerical expressions that can be specified using the standard planning language PDDL. These techniques ar...
Alfonso Gerevini, Alessandro Saetti, Ivan Serina
AIPS
2006
14 years 10 months ago
New Complexity Results for Classical Planning Benchmarks
The 3rd and 4th International Planning Competitions have enriched the set of benchmarks for classical propositional planning by a number of novel and interesting planning domains....
Malte Helmert
CEC
2010
IEEE
14 years 10 months ago
Beyond No Free Lunch: Realistic algorithms for arbitrary problem classes
In this paper we present a simple and general new No Free Lunch-like result that applies to revisiting algorithms searching arbitrary problem sets. We begin by unifying the assumpt...
James A. R. Marshall, Thomas G. Hinton
71
Voted
AI
2006
Springer
14 years 9 months ago
Solving logic program conflict through strong and weak forgettings
We consider how to forget a set of atoms in a logic program. Intuitively, when a set of atoms is forgotten from a logic program, all atoms in the set should be eliminated from thi...
Yan Zhang, Norman Y. Foo
DCAI
2008
14 years 11 months ago
The Intelligent Butler: A Virtual Agent for Disabled and Elderly People Assistance
Abstract. Social assistance constitutes an increasing problem in developed countries, which can be considered from two dimensions: the home and the hospital frameworks. Anyway, mos...
Gabriel Fiol-Roig, Diana Arellano, Francisco J. Pe...