Sciweavers

77 search results - page 14 / 16
» Polynomial Interrupt Timed Automata
Sort
View
IPPS
2008
IEEE
14 years 20 days ago
Software monitoring with bounded overhead
In this paper, we introduce the new technique of HighConfidence Software Monitoring (HCSM), which allows one to perform software monitoring with bounded overhead and concomitantl...
Sean Callanan, David J. Dean, Michael Gorbovitski,...
IANDC
2011
91views more  IANDC 2011»
13 years 1 months ago
Queries on Xml streams with bounded delay and concurrency
Query answering algorithms on Xml streams check answer candidates on the fly in order to avoid the unnecessary buffering whenever possible. The delay and concurrency of a query ...
Olivier Gauwin, Joachim Niehren, Sophie Tison
FOIKS
2004
Springer
13 years 11 months ago
Query Answering and Containment for Regular Path Queries under Distortions
Abstract. We give a general framework for approximate query processing in semistructured databases. We focus on regular path queries, which are the integral part of most of the que...
Gösta Grahne, Alex Thomo
ICSOC
2004
Springer
13 years 11 months ago
Automated composition of e-services: lookaheads
The e-services paradigm promises to enable rich, flexible, and dynamic inter-operation of highly distributed, heterogeneous networkenabled services. Among the challenges, a funda...
Cagdas Evren Gerede, Richard Hull, Oscar H. Ibarra...
CAV
2010
Springer
190views Hardware» more  CAV 2010»
13 years 9 months ago
Measuring and Synthesizing Systems in Probabilistic Environments
Often one has a preference order among the different systems that satisfy a given specification. Under a probabilistic assumption about the possible inputs, such a preference order...
Krishnendu Chatterjee, Thomas A. Henzinger, Barbar...