Sciweavers

261 search results - page 48 / 53
» A New Unfolding Approach to LTL Model Checking
Sort
View
DAC
2005
ACM
13 years 9 months ago
Prime clauses for fast enumeration of satisfying assignments to boolean circuits
Finding all satisfying assignments of a propositional formula has many applications in the design of hardware and software. An approach to this problem augments a clause-recording...
HoonSang Jin, Fabio Somenzi
IJCAI
2007
13 years 9 months ago
Tractable Temporal Reasoning
Temporal reasoning is widely used within both Computer Science and A.I. However, the underlying complexity of temporal proof in discrete temporal logics has led to the use of simp...
Clare Dixon, Michael Fisher, Boris Konev
SIMULATION
1998
177views more  SIMULATION 1998»
13 years 7 months ago
Simulation and Planning of an Intermodal Container Terminal
A decision support system for the management of an intermodal container terminal is presented. Among the problems to be solved, there are the spatial allocation of containers on t...
Luca Maria Gambardella, Andrea Emilio Rizzoli, Mar...
TCC
2009
Springer
255views Cryptology» more  TCC 2009»
14 years 8 months ago
LEGO for Two-Party Secure Computation
The first and still most popular solution for secure two-party computation relies on Yao's garbled circuits. Unfortunately, Yao's construction provide security only again...
Jesper Buus Nielsen, Claudio Orlandi
CCS
2005
ACM
14 years 1 months ago
Direct chosen ciphertext security from identity-based techniques
We describe a new encryption technique that is secure in the standard model against adaptive chosen ciphertext (CCA2) attacks. We base our method on two very efficient Identity-Ba...
Xavier Boyen, Qixiang Mei, Brent Waters