Sciweavers

3495 search results - page 43 / 699
» On the random satisfiable process
Sort
View
CIE
2006
Springer
15 years 4 months ago
Forcing with Random Variables and Proof Complexity
or representation theory of groups), and even borrows abstract geometrical concepts like Euler characteristic or Grothendieck ring. However, the most stimulating for proof complexi...
Jan Krajícek
ITC
1995
IEEE
104views Hardware» more  ITC 1995»
15 years 4 months ago
Synthesis of Mapping Logic for Generating Transformed Pseudo-Random Patterns for BIST
During built-in self-test (BIST), the set of patterns generated by a pseudo-random pattern generator may not provide a sufficiently high fault coverage. This paper presents a new ...
Nur A. Touba, Edward J. McCluskey
105
Voted
KDD
2007
ACM
192views Data Mining» more  KDD 2007»
16 years 1 months ago
Allowing Privacy Protection Algorithms to Jump Out of Local Optimums: An Ordered Greed Framework
Abstract. As more and more person-specific data like health information becomes available, increasing attention is paid to confidentiality and privacy protection. One proposed mode...
Rhonda Chaytor
111
Voted
EDBT
2004
ACM
131views Database» more  EDBT 2004»
16 years 24 days ago
Declustering Two-Dimensional Datasets over MEMS-Based Storage
Due to the large difference between seek time and transfer time in current disk technology, it is advantageous to perform large I/O using a single sequential access rather than mu...
Hailing Yu, Divyakant Agrawal, Amr El Abbadi
78
Voted
ICC
2009
IEEE
15 years 7 months ago
A Laplace Transform-Based Method to Stochastic Path Finding
—Finding the most likely path satisfying a requested additive Quality-of-Service (QoS) value, such as delay, when link metrics are defined as random variables by known probabili...
Suleyman Uludag, Ziyneti Elif Uludag, Klara Nahrst...