250 search results - page 22 / 50 » The complexity of temporal constraint satisfaction problems |
GECCO
2005
Springer
14 years 2 months ago
2005
Springer
This paper proposes an incremental approach for building solutions using evolutionary computation. It presents a simple evolutionary model called a Transition model in which parti...
AGI
2008
13 years 10 months ago
2008
Whereas symbol
STDBM
2004
Springer
14 years 1 months ago
2004
Springer
With the recent progress of spatial information technologies and mobile computing technologies, spatio-temporal databases which store information on moving objects including vehicl...
CP
2004
Springer
14 years 2 months ago
2004
Springer
Constraint programming is rapidly becoming the technology of choice for modeling and solving complex combinatorial problems. However, users of constraint programming technology nee...
SIAMDM
2010
13 years 7 months ago
2010
For a fixed graph H, let Ret(H) denote the problem of deciding whether a given input graph is retractable to H. We classify the complexity of Ret(H) when H is a graph (with loops ...