139 search results - page 18 / 28 » A Grid-enabled Branch and Bound Algorithm for Solving Challe... |
119
click to vote
APPROX
2010
Springer
15 years 4 months ago
2010
Springer
We give a simple combinatorial proof of the Chernoff-Hoeffding concentration bound [Che52, Hoe63], which says that the sum of independent {0, 1}-valued random variables is highly ...
155
Voted
GLOBECOM
2008
IEEE
15 years 9 months ago
2008
IEEE
—We consider the problem of joint routing, scheduling and power control in multi-hop wireless networks. We use a linear relation between link capacity and signal to interference ...
145
Voted
CPAIOR
2008
Springer
15 years 5 months ago
2008
Springer
Theoretical models for the evaluation of quickly improving search strategies, like limited discrepancy search, are based on specific assumptions regarding the probability that a va...
167
Voted
AAAI
2008
15 years 5 months ago
2008
When controlling dynamic systems, such as mobile robots in uncertain environments, there is a trade off between risk and reward. For example, a race car can turn a corner faster b...
182
click to vote
FOGA
2011
14 years 6 months ago
2011
The distribution of fitness values across a set of states sharply influences the dynamics of evolutionary processes and heuristic search in combinatorial optimization. In this p...