3495 search results - page 391 / 699 » On the random satisfiable process |
209
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
The overlap number of a finite (d + 1)-uniform hypergraph H is the largest constant c(H) (0, 1] such that no matter how we map the vertices of H into Rd , there is a point covered...
173
click to vote
AICOM
2006
15 years 6 months ago
2006
In this work we present a backjumping technique for Disjunctive Logic Programming (DLP) under the Answer Set Semantics. It builds upon related techniques that had originally been p...
202
click to vote
IJSI
2008
15 years 6 months ago
2008
Many data mining applications have a large amount of data but labeling data is often difficult, expensive, or time consuming, as it requires human experts for annotation. Semi-supe...
173
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
In this paper, we consider an automatic-repeat-request (ARQ) retransmission protocol signaling over a block-fading multiple-input, multiple-output (MIMO) channel. Unlike previous ...
208
click to vote
JSAT
2008
15 years 6 months ago
2008
The local search algorithm GSAT is based on the notion of Satisfiability. It has been used successfully for colouring graphs, solving instances of the 3SAT problem, planning block...