1806 search results - page 97 / 362 » Randomness and halting probabilities |
CEC
2005
IEEE
15 years 9 months ago
2005
IEEE
Abstract- Markov Random Field (MRF) modelling techniques have been recently proposed as a novel approach to probabilistic modelling for Estimation of Distribution Algorithms (EDAs)...
101
Voted
SPDP
1991
IEEE
15 years 7 months ago
1991
IEEE
In this paper, we present a randomized algorithm for the multipacket (i.e., k − k) routing problem on an n × n mesh. The algorithm completes with high probability in at the mos...
118
Voted
ATAL
2008
Springer
15 years 5 months ago
2008
Springer
We propose Markov random fields (MRFs) as a probabilistic mathematical model for unifying approaches to multi-robot coordination or, more specifically, distributed action selectio...
147
Voted
IM
2008
15 years 3 months ago
2008
Let G = G(n, r) be a random geometric graph resulting from placing n nodes uniformly at random in the unit square (disk) and connecting every two nodes if and only if their Euclide...
170
click to vote
CORR
2007
Springer
15 years 3 months ago
2007
Springer
—In a sensor network, in practice, the communication among sensors is subject to: 1) errors that can cause failures of links among sensors at random times; 2) costs; and 3) const...