Sciweavers

3229 search results - page 180 / 646
» The Theory of Timed Automata
Sort
View
STOC
1993
ACM
134views Algorithms» more  STOC 1993»
15 years 10 months ago
Quantum complexity theory
In this paper we study quantum computation from a complexity theoretic viewpoint. Our first result is the existence of an efficient universal quantum Turing machine in Deutsch’s...
Ethan Bernstein, Umesh V. Vazirani
WINET
2002
144views more  WINET 2002»
15 years 6 months ago
Exposure in Wireless Sensor Networks: Theory and Practical Solutions
Wireless ad-hoc sensor networks have the potential to provide the missing interface between the physical world and the Internet, thus impacting a large number of users. This conne...
Seapahn Megerian, Farinaz Koushanfar, Gang Qu, Gia...
ECLIPSE
2006
ACM
15 years 10 months ago
A toolsuite for the verification of real-time systems in Eclipse
In this work we present an Eclipse plug-in for the VInTiMe (Verifier of INtegrated TImed ModEls)1 suite of tools that combines high-level expressive power, unassisted propertypres...
Lucía Cavatorta, Guido de Caso, André...
FROCOS
2007
Springer
16 years 21 days ago
Noetherianity and Combination Problems
In abstract algebra, a structure is said to be Noetherian if it does not admit infinite strictly ascending chains of congruences. In this paper, we adapt this notion to first-ord...
Silvio Ghilardi, Enrica Nicolini, Silvio Ranise, D...
LATA
2010
Springer
16 years 3 months ago
Untestable Properties Expressible with Four First-Order Quantifiers
Abstract. In property testing, the goal is to distinguish between structures that have some desired property and those that are far from having the property, after examining only a...
Charles Jordan and Thomas Zeugmann