5138 search results - page 149 / 1028 » Randomized Algorithms for 3-SAT |
122
click to vote
MOBIHOC
2006
ACM
16 years 2 months ago
2006
ACM
This paper presents a distributed implementation of RAND, a randomized time slot scheduling algorithm, called DRAND. DRAND runs in O() time and message complexity where is the max...
116
click to vote
AMAI
2004
Springer
15 years 8 months ago
2004
Springer
Recent dynamic local search (DLS) algorithms such as SAPS are amongst the state-of-the-art methods for solving the propositional satisfiability problem (SAT). DLS algorithms modi...
125
click to vote
GPEM
2007
15 years 2 months ago
2007
Our rapidly growing knowledge regarding genetic variation in the human genome offers great potential for understanding the genetic etiology of disease. This, in turn, could revolut...
112
click to vote
ACL
2009
15 years 25 days ago
2009
This paper presents an efficient inference algorithm of conditional random fields (CRFs) for large-scale data. Our key idea is to decompose the output label state into an active s...
163
click to vote
AML
2011
14 years 10 months ago
2011
The notion of superhigh computably enumerable (c.e.) degrees was first introduced by Mohrherr in [7], where she proved the existence of incomplete superhigh c.e. degrees, and high...