43 search results - page 5 / 9 » Phase transition in a random NK landscape model |
ICAI
2003
13 years 8 months ago
2003
Boolean satisfiability (SAT) is the canonical NP-complete problem that plays an important role in AI and has many practical applications in Computer Science in general. Boolean n...
ACRI
2004
Springer
14 years 26 days ago
2004
Springer
Large areas of savannas are found in Africa in climatic zones favourable to humid tropical forests: they are relicts of past dry periods and forest domains are naturally expanding....
JAIR
2007
13 years 7 months ago
2007
In this paper, we study the possibility of designing non-trivial random CSP models by exploiting the intrinsic connection between structures and typical-case hardness. We show tha...
JSAT
2006
13 years 7 months ago
2006
An analysis of the SAT 2005 sub-competition on random instances is given. This year this (sub-)competition set-up was geared to establish a basic setting, focusing on the instance...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
The paper has two objectives. The first is to study rigorously the transient behavior of some P2P networks where information is replicated and disseminated according to an epidemic...