9842 search results - page 273 / 1969 » Problem complexity |
204
click to vote
FOSSACS
2007
Springer
15 years 10 months ago
2007
Springer
In a seminal paper from 1985, Sistla and Clarke showed that satisfiability for Linear Temporal Logic (LTL) is either NP-complete or PSPACE-complete, depending on the set of tempora...
176
click to vote
EUROCOLT
1995
Springer
15 years 10 months ago
1995
Springer
Limiting identification of r.e. indexes for r.e. languages (from a presentation of elements of the language) and limiting identification of programs for computable functions (fr...
200
click to vote
ECCV
2010
Springer
15 years 9 months ago
2010
Springer
Abstract. We describe a clustering approach with the emphasis on detecting coherent structures in a complex dataset, and illustrate its effectiveness with computer vision applicat...
195
click to vote
ATAL
2010
Springer
15 years 7 months ago
2010
Springer
Decentralized POMDPs provide an expressive framework for sequential multi-agent decision making. Despite their high complexity, there has been significant progress in scaling up e...
148
click to vote
BIOSYSTEMS
2007
15 years 6 months ago
2007
The structural organization of biological systems is one of nature’s most fascinating aspects, but its origin and functional role is not yet fully understood. For instance, basi...