Sciweavers

6251 search results - page 43 / 1251
» Randomness, Computability, and Density
Sort
View
AAAI
2008
13 years 11 months ago
Backdoor Trees
The surprisingly good performance of modern satisfiability (SAT) solvers is usually explained by the existence of a certain "hidden structure" in real-world instances. W...
Marko Samer, Stefan Szeider
CORR
2006
Springer
123views Education» more  CORR 2006»
13 years 8 months ago
Directed animals in the gas
In this paper, we revisit the enumeration of directed animals using gas models. We show that there exists a natural construction of random directed animals on any directed graph t...
Yvan Le Borgne, Jean-François Marckert
COMBINATORICS
2007
67views more  COMBINATORICS 2007»
13 years 8 months ago
Directed Animals and Gas Models Revisited
In this paper, we revisit the enumeration of directed animals using gas models. We show that there exists a natural construction of random directed animals on any directed graph t...
Yvan Le Borgne, Jean-François Marckert
RANDOM
2001
Springer
14 years 1 months ago
On Computing Ad-hoc Selective Families
Andrea E. F. Clementi, Pierluigi Crescenzi, Angelo...
ICCCN
2007
IEEE
14 years 3 months ago
Serial Sum-Product Architecture for Low-Density Parity-Check Codes
—A serial sum-product architecture for low-density parity-check (LDPC) codes is presented. In the proposed architecture, a standard bit node processing unit computes the bit to c...
Ruwan N. S. Ratnayake, Erich F. Haratsch, Gu-Yeon ...