Sciweavers

343 search results - page 50 / 69
» Purely Relational FLWORs
Sort
View
LICS
1996
IEEE
15 years 10 months ago
The Theory of Hybrid Automata
Ahybrid automatonis a formalmodelfor a mixeddiscrete-continuous system. We classify hybrid automata acoording to what questions about their behavior can be answered algorithmically...
Thomas A. Henzinger
HYBRID
1994
Springer
15 years 10 months ago
Symbolic Controller Synthesis for Discrete and Timed Systems
This paper presents algorithms for the symbolic synthesis of discrete and real-time controllers. At the semantic level the controller is synthesized by nding a winning strategy for...
Eugene Asarin, Oded Maler, Amir Pnueli
CSFW
2010
IEEE
15 years 10 months ago
Robustness Guarantees for Anonymity
—Anonymous communication protocols must achieve two seemingly contradictory goals: privacy (informally, they must guarantee the anonymity of the parties that send/receive informa...
Gilles Barthe, Alejandro Hevia, Zhengqin Luo, Tama...
SUTC
2010
IEEE
15 years 10 months ago
Data Caching in Ad Hoc Networks Using Game-Theoretic Analysis
— Extensive research has been performed to study selfish data caching in ad hoc networks using game-theoretic analysis. However, due to the caching problem’s theoretical root ...
Yutian Chen, Bin Tang
FOCS
2004
IEEE
15 years 9 months ago
An Approximate Max-Steiner-Tree-Packing Min-Steiner-Cut Theorem
Given an undirected multigraph G and a subset of vertices S V (G), the STEINER TREE PACKING problem is to find a largest collection of edge-disjoint trees that each connects S. T...
Lap Chi Lau