3495 search results - page 3 / 699 » On the random satisfiable process |
CORR
1999
Springer
13 years 5 months ago
1999
Springer
A variational approach to finite connectivity spin-glass-like models is developed and applied to describe the structure of optimal solutions in random satisfiability problems. Our ...
SODA
2000
ACM
13 years 7 months ago
2000
ACM
: k-SAT is one of the best known among a wide class of random constraint satisfaction problems believed to exhibit a threshold phenomenon where the control parameter is the ratio, ...
VLSID
2002
IEEE
14 years 6 months ago
2002
IEEE
In preemptive real-time systems, a tighter estimate of the Worst Case Response Time(WCRT) of the tasks can be obtained if the layout of the tasks in memory is included in the esti...
IGPL
2006
13 years 6 months ago
2006
Abstract. k-SAT is a fundamental constraint satisfaction problem. It involves S(m), the satisfaction set of the conjunction of m clauses, each clause a disjunction of k literals. T...
SAT
2005
Springer
13 years 11 months ago
2005
Springer
