Sciweavers

2661 search results - page 248 / 533
» Quantum Complexity Classes
Sort
View
HYBRID
2007
Springer
15 years 8 months ago
Diagnosability Verification for Hybrid Automata
A notion of diagnosability for hybrid systems is defined, which generalizes the notion of observability. We verify bility properties on a timed automaton abstraction of the origina...
Maria Domenica Di Benedetto, Stefano Di Gennaro, A...
117
Voted
RT
1995
Springer
15 years 7 months ago
Spherical Wavelets: Texture Processing
: Wavelets are a powerful tool forplanar image processing. The resulting algorithms are straightforward, fast, and efficient. With the recently developed spherical wavelets this f...
Peter Schröder, Wim Sweldens
PODS
1991
ACM
93views Database» more  PODS 1991»
15 years 7 months ago
The Expressiveness of a Family of Finite Set Languages
In this paper we characterise exactly the complexity of a set based database language called SRL, which presents a unified framework for queries and updates. By imposing simple s...
Neil Immerman, Sushant Patnaik, David W. Stemple
ASWC
2009
Springer
15 years 7 months ago
Reasoning about Partially Ordered Web Service Activities in PSL
Many tasks within semantic web service discovery can be formalized as reasoning problems related to the partial ordering of subactivity occurrences in a complex activity. We show h...
Michael Gruninger, Xing Tan
AIPS
2007
15 years 6 months ago
Structural Patterns of Tractable Sequentially-Optimal Planning
We study the complexity of sequentially-optimal classical planning, and discover new problem classes for whose such optimization is tractable. The results are based on exploiting ...
Michael Katz, Carmel Domshlak