Sciweavers

1763 search results - page 27 / 353
» Dependent random choice
Sort
View
SAFECOMP
2009
Springer
14 years 1 months ago
A Foundation for Requirements Analysis of Dependable Software
We present patterns for expressing dependability requirements, such as confidentiality, integrity, availability, and reliability. The paper considers random faults as well as cert...
Denis Hatebur, Maritta Heisel
JSAT
2008
79views more  JSAT 2008»
13 years 9 months ago
An Extended Semidefinite Relaxation for Satisfiability
This paper proposes a new semidefinite programming relaxation for the satisfiability problem. This relaxation is an extension of previous relaxations arising from the paradigm of ...
Miguel F. Anjos
WSC
2008
13 years 11 months ago
A plug-in-based architecture for random number generation in simulation systems
Simulations often depend heavily on random numbers, yet the impact of random number generators is recognized seldom. The generation of random numbers for simulations is not trivia...
Roland Ewald, Johannes Rossel, Jan Himmelspach, Ad...
MOBISYS
2006
ACM
14 years 8 months ago
Feasibility study of mesh networks for all-wireless offices
There is a fair amount of evidence that mesh (static multihop wireless) networks are gaining popularity, both in the academic literature and in the commercial space. Nonetheless, ...
Jakob Eriksson, Sharad Agarwal, Paramvir Bahl, Jit...
SODA
2010
ACM
209views Algorithms» more  SODA 2010»
14 years 6 months ago
Counting Stars and Other Small Subgraphs in Sublinear Time
Detecting and counting the number of copies of certain subgraphs (also known as network motifs or graphlets), is motivated by applications in a variety of areas ranging from Biolo...
Mira Gonen, Dana Ron, Yuval Shavitt