Sciweavers

323 search results - page 4 / 65
» Distributed Verification and Hardness of Distributed Approxi...
Sort
View
CAV
2007
Springer
122views Hardware» more  CAV 2007»
13 years 11 months ago
Parameterized Verification of Infinite-State Processes with Global Conditions
We present a simple and effective approximated backward reachability algorithm for parameterized systems with existentially and universally quantified global conditions. The indivi...
Parosh Aziz Abdulla, Giorgio Delzanno, Ahmed Rezin...
STOC
2005
ACM
93views Algorithms» more  STOC 2005»
14 years 7 months ago
Representing hard lattices with O(n log n) bits
We present a variant of the Ajtai-Dwork public-key cryptosystem where the size of the public-key is only O(n log n) bits and the encrypted text/clear text ratio is also O(n log n)...
Miklós Ajtai
ECCC
2010
124views more  ECCC 2010»
13 years 7 months ago
Lower Bounds and Hardness Amplification for Learning Shallow Monotone Formulas
Much work has been done on learning various classes of "simple" monotone functions under the uniform distribution. In this paper we give the first unconditional lower bo...
Vitaly Feldman, Homin K. Lee, Rocco A. Servedio
ICPP
1998
IEEE
13 years 11 months ago
Response Time Analysis for Distributed Real-Time Systems with Bursty Job Arrivals
This paper presents a new schedulability analysis methodology for distributed hard real-time systems with bursty job arrivals. The schedulability is analyzed by comparing worst-ca...
Chengzhi Li, Riccardo Bettati, Wei Zhao
CAV
2009
Springer
116views Hardware» more  CAV 2009»
14 years 5 days ago
Priority Scheduling of Distributed Systems Based on Model Checking
Priorities are used to control the execution of systems to meet given requirements for optimal use of resources, e.g., by using scheduling policies. For distributed systems, it is ...
Ananda Basu, Saddek Bensalem, Doron Peled, Joseph ...