Sciweavers

893 search results - page 1 / 179
» P3C: A New Algorithm for the Simple Temporal Problem
Sort
View
AIPS
2008
13 years 7 months ago
P3C: A New Algorithm for the Simple Temporal Problem
Léon Planken, Mathijs de Weerdt, Roman van ...
TIME
2006
IEEE
13 years 11 months ago
Ultimately Periodic Simple Temporal Problems (UPSTPs)
In this paper, we consider quantitative temporal or spatial constraint networks whose constraints evolve over time in an ultimately periodic fashion. These constraint networks are...
Jean-François Condotta, Gérard Ligoz...
ANOR
2011
117views more  ANOR 2011»
12 years 9 months ago
A simple and effective algorithm for the MaxMin diversity problem
The challenge of maximizing the diversity of a collection of points arises in a variety of settings, including the setting of search methods for hard optimization problems. One ver...
Daniel Cosmin Porumbel, Jin-Kao Hao, Fred Glover
NECO
2008
116views more  NECO 2008»
13 years 5 months ago
A (Somewhat) New Solution to the Variable Binding Problem
To perform automatic, unconscious inference, the human brain must solve the "binding problem" by correctly grouping properties with objects. Temporal binding models like...
Leon Barrett, Jerome Feldman, Liam Mac Dermed
AAAI
2008
13 years 7 months ago
Planning with Problems Requiring Temporal Coordination
We present the first planner capable of reasoning with both the full semantics of PDDL2.1 (level 3) temporal planning and with numeric resources. Our planner, CRIKEY3, employs heu...
Andrew Coles, Maria Fox, Derek Long, Amanda Smith