9 search results - page 2 / 2 » jal 2000 |
JAL
2000
14 years 11 months ago
2000
115
click to vote
JAL
2000
14 years 11 months ago
2000
The (unweighted) Maximum Satisfiability problem (MaxSat) is: given a boolean formula in conjunctive normal form, find a truth assignment that satisfies the most number of clauses....
115
click to vote
JAL
2000
14 years 11 months ago
2000
Random independent sets in graphs arise, for example, in statistical physics, in the hard-core model of a gas. In 1997, Luby and Vigoda described a rapidly mixing Markov chain for...
JAL
2002
14 years 11 months ago
2002
We take a multivariate view of digital search trees by studying the number of nodes of different types that may coexist in a bucket digital search tree as it grows under an arbitr...