Sciweavers

1971 search results - page 171 / 395
» Tabu search - Uncharted domains
Sort
View
JAIR
2010
167views more  JAIR 2010»
15 years 4 months ago
The LAMA Planner: Guiding Cost-Based Anytime Planning with Landmarks
LAMA is a classical planning system based on heuristic forward search. Its core feature is the use of a pseudo-heuristic derived from landmarks, propositional formulas that must b...
Silvia Richter, Matthias Westphal
COMPGEOM
2010
ACM
15 years 11 months ago
Constructing Reeb graphs using cylinder maps
The Reeb graph of a scalar function represents the evolution of the topology of its level sets. In this video, we describe a near-optimal output-sensitive algorithm for computing ...
Harish Doraiswamy, Aneesh Sood, Vijay Natarajan
ECML
2006
Springer
15 years 10 months ago
Scaling Model-Based Average-Reward Reinforcement Learning for Product Delivery
Reinforcement learning in real-world domains suffers from three curses of dimensionality: explosions in state and action spaces, and high stochasticity. We present approaches that ...
Scott Proper, Prasad Tadepalli
ERSHOV
2006
Springer
15 years 10 months ago
A Knowledge Portal for Cultural Information Resources: Towards an Architecture
The paper presents a concept and architecture of specialized Internet portal providing semantic access to knowledge and information resources (electronic collections) for any given...
Yury A. Zagorulko, Jawed I. A. Siddiqi, Babak Akhg...
AAAI
2007
15 years 8 months ago
An Experimental Comparison of Constraint Logic Programming and Answer Set Programming
Answer Set Programming (ASP) and Constraint Logic Programming over finite domains (CLP(FD)) are two declarative programming paradigms that have been extensively used to encode ap...
Agostino Dovier, Andrea Formisano, Enrico Pontelli