3049 search results - page 93 / 610 » On the Convergence of Bound Optimization Algorithms |
123
click to vote
ICARIS
2005
Springer
15 years 10 months ago
2005
Springer
An exact Markov chain model of the B-cell algorithm (BCA) is constructed via a novel possible transit method. The model is used to formulate a proof that the BCA is convergent abso...
144
click to vote
RFIDSEC
2010
15 years 2 months ago
2010
Abstract. In this paper, we classify the RFID distance bounding protocols having bitwise fast phases and no final signature. We also give the theoretical security bounds for two s...
168
click to vote
AAAI
2000
15 years 5 months ago
2000
Depth-first branch-and-bound (DFBnB) is a complete algorithm that is typically used to find optimal solutions of difficult combinatorial optimization problems. It can also be adap...
140
click to vote
SIROCCO
2004
15 years 5 months ago
2004
A black hole is a harmful host that destroys incoming agents without leaving any observable trace of such a destruction. The black hole search problem is to unambiguously determine...
169
click to vote
TWC
2008
15 years 4 months ago
2008
A novel framework was introduced recently for stochastic routing in wireless multihop networks, whereby each node selects a neighbor to forward a packet according to a probability...