Sciweavers

247 search results - page 41 / 50
» Perspectives in Probabilistic Verification
Sort
View
C3S2E
2010
ACM
13 years 10 months ago
Scalable formula decomposition for propositional satisfiability
Propositional satisfiability solving, or SAT, is an important reasoning task arising in numerous applications, such as circuit design, formal verification, planning, scheduling or...
Anthony Monnet, Roger Villemaire
CORR
2010
Springer
133views Education» more  CORR 2010»
13 years 9 months ago
Access-Network Association Policies for Media Streaming in Heterogeneous Environments
Abstract--We study the design of media streaming applications in the presence of multiple heterogeneous wireless access methods with different throughputs and costs. Our objective ...
Ali ParandehGheibi, Muriel Médard, Asuman E...
SIAMAM
2008
74views more  SIAMAM 2008»
13 years 9 months ago
Optimal Liquidation by a Large Investor
Abstract. We develop a partial equilibrium model to investigate the problem of optimal liquidation over a finite or infinite time horizon for an investor with large holdings in a r...
Ajay Subramanian
CORR
2010
Springer
225views Education» more  CORR 2010»
13 years 9 months ago
Analysis of the Security of BB84 by Model Checking
Quantum Cryptography or Quantum key distribution (QKD) is a technique that allows the secure distribution of a bit string, used as key in cryptographic protocols. When it was note...
Mohamed Elboukhari, Mostafa Azizi, Abdelmalek Aziz...
POPL
2009
ACM
14 years 10 months ago
Formal certification of code-based cryptographic proofs
As cryptographic proofs have become essentially unverifiable, cryptographers have argued in favor of developing techniques that help tame the complexity of their proofs. Game-base...
Benjamin Grégoire, Gilles Barthe, Santiago ...