Sciweavers

3495 search results - page 40 / 699
» On the random satisfiable process
Sort
View
AAAI
2000
14 years 3 days ago
Redundancy in Random SAT Formulas
The random k-SAT model is extensively used to compare satisfiability algorithms or to find the best settings for the parameters of some algorithm. Conclusions are derived from the...
Yacine Boufkhad, Olivier Roussel
SIAMJO
2008
99views more  SIAMJO 2008»
13 years 10 months ago
The Exact Feasibility of Randomized Solutions of Uncertain Convex Programs
Many optimization problems are naturally delivered in an uncertain framework, and one would like to exercise prudence against the uncertainty elements present in the problem. In pr...
Marco C. Campi, Simone Garatti
CDC
2009
IEEE
181views Control Systems» more  CDC 2009»
14 years 3 months ago
Stability of switched linear systems and the convergence of random products
— In this paper we give conditions that a discrete time switched linear systems must satisfy if it is stable. We do this by calculating the mean and covariance of the set of matr...
Ning Wang, Magnus Egerstedt, Clyde F. Martin
AISC
2008
Springer
14 years 23 days ago
Strategies for Solving SAT in Grids by Randomized Search
Grid computing offers a promising approach to solving challenging computational problems in an environment consisting of a large number of easily accessible resources. In this pape...
Antti Eero Johannes Hyvärinen, Tommi A. Juntt...
EUROCRYPT
2009
Springer
14 years 11 months ago
Verifiable Random Functions from Identity-Based Key Encapsulation
We propose a methodology to construct verifiable random functions from a class of identity based key encapsulation mechanisms (IB-KEM) that we call VRF suitable. Informally, an IB-...
Michel Abdalla, Dario Catalano, Dario Fiore