1547 search results - page 61 / 310 » Randomized Variable Elimination |
161
Voted
RSA
2006
15 years 2 months ago
2006
We present a (non-standard) probabilistic analysis of dynamic data structures whose sizes are considered as dynamic random walks. The basic operations (insertion, deletion, positi...
116
Voted
CORR
2011
Springer
14 years 6 months ago
2011
Springer
Let Φ be a uniformly distributed random k-SAT formula with n variables and m clauses. We prove that the Walksat algorithm from [16, 17] finds a satisfying assignment of Φ in pol...
116
Voted
IWOCA
2009
Springer
15 years 9 months ago
2009
Springer
The construction of covering arrays with the fewest rows remains a challenging problem. Most computational and recursive constructions result in extensive repetition of coverage. W...
120
click to vote
ISCC
2007
IEEE
15 years 9 months ago
2007
IEEE
Window-based congestion control is typically based on exhausting bandwidth capacity, which occasionally leads to transient congestion. Moreover, flow synchronization may deteriora...
125
Voted
INFOCOM
2000
IEEE
15 years 7 months ago
2000
IEEE
We present a framework for designing end-to-end congestion control schemes in a network where each user may have a different utility function and may experience non-congestion-re...