3495 search results - page 68 / 699 » On the random satisfiable process |
96
Voted
HICSS
2006
IEEE
15 years 6 months ago
2006
IEEE
— Uniform sampling in networks is at the core of a wide variety of randomized algorithms. Random sampling can be performed by modeling the system as an undirected graph with asso...
129
click to vote
ICASSP
2009
IEEE
15 years 7 months ago
2009
IEEE
Abstract –In this paper, a variational message passing framework is proposed for Markov random fields, which is computationally more efficient and admits wider applicability comp...
114
click to vote
PDPTA
2008
15 years 2 months ago
2008
- For an iterative process to be parallelized, the operations that comprise the process must be organized into a correct schedule that will allow the hardware to compute the task. ...
83
Voted
ICASSP
2011
IEEE
14 years 4 months ago
2011
IEEE
Random binary matrices have found many applications in signal processing and coding. Rateless codes, for example, are based on the random generation of codewords by means of inner...
JAIR
2000
15 years 15 days ago
2000
The local search algorithm WSat is one of the most successful algorithms for solving the satisfiability (SAT) problem. It is notably effective at solving hard Random 3-SAT instanc...