1381 search results - page 197 / 277 » Computational Complexity of Constraint Satisfaction |
KR
1989
Springer
14 years 2 months ago
1989
Springer
In this work we extend the work of Dean, Kaelbling, Kirman and Nicholson on planning under time constraints in stochastic domains to handle more complicated scheduling problems. I...
CL
2004
Springer
13 years 10 months ago
2004
Springer
A new algorithm is introduced for analyzing possible nestings in mobile ambient calculus. It improves both time and space complexities of the technique proposed by Nielson and Sei...
AICOM
2000
13 years 10 months ago
2000
This paper describes a model of the emergence and the universal structural tendencies of vowel systems. Both are considered as the result of self-organisation in a population of l...
IJPRAI
2000
13 years 10 months ago
2000
As Bayesian networks become widely accepted as a normative formalism for diagnosis based on probabilistic knowledge, they are applied to increasingly larger problem domains. These...
IJCV
2002
13 years 9 months ago
2002
We present a method to automatically extract spatio-temporal descriptions of moving objects from synchronized and calibrated multi-view sequences. The object is modeled by a time-...