4377 search results - page 513 / 876 » Mass problems and randomness |
170
click to vote
JAIR
2000
15 years 6 months ago
2000
The local search algorithm WSat is one of the most successful algorithms for solving the satisfiability (SAT) problem. It is notably effective at solving hard Random 3-SAT instanc...
213
click to vote
CIKM
2010
Springer
15 years 5 months ago
2010
Springer
In image retrieval, most existing approaches that incorporate local features produce high dimensional vectors, which lead to a high computational and data storage cost. Moreover, ...
206
click to vote
TON
2010
15 years 5 months ago
2010
—We consider opportunistic routing in wireless mesh networks. We exploit the inherent diversity of the broadcast nature of wireless by making use of multi-path routing. We presen...
235
click to vote
ECCC
2011
15 years 1 months ago
2011
A family of permutations in Sn is k-wise independent if a uniform permutation chosen from the family maps any distinct k elements to any distinct k elements equally likely. Effici...
233
click to vote
ICDCN
2011
Springer
14 years 10 months ago
2011
Springer
We address the problem of designing distributed algorithms for large scale networks that are robust to Byzantine faults. We consider a message passing, full information model: the ...