Sciweavers

7 search results - page 2 / 2
» Simple Constructions of Almost k-Wise Independent Random Var...
Sort
View
APPROX
2004
Springer
125views Algorithms» more  APPROX 2004»
13 years 10 months ago
Strong Refutation Heuristics for Random k-SAT
A simple first moment argument shows that in a randomly chosen k-SAT formula with m clauses over n boolean variables, the fraction of satisfiable clauses is 1−2−k +o(1) as m/...
Amin Coja-Oghlan, Andreas Goerdt, André Lan...
INTERNET
2010
119views more  INTERNET 2010»
13 years 3 months ago
A Chat Application in Lift
s the HTTP request–response cycle rather than wrapping HTTP concepts in APIs. This means you put HTML element definition and action in the same place: var name = "" SHt...
David Pollak, Steve Vinoski