Results 281 to 290 of about 6,035,490 (336)

Biased diffusion on random structures

Philosophical Magazine B, 1987
Abstract We discuss topologically biased diffusion on random structures (e.g. a random comb, a percolation cluster) that are characterized by effective dangling ends. The distribution of lengths L of dangling ends determines the transport behaviour. For a power-law distribution (percolation cluster at p c) diffusion is ultra-anomalously slow, the mean ...
Armin Bunde, Shlomo Havlin
openaire   +1 more source

Biased random walk on a deterministic fractal

Physical Review A, 1990
Anisotropic diffusion on a Sierp{ital riaa}nski gasket is studied using renormalization equations for the probability densities of waiting times. The effect of an external field on a random walk is described in terms of the dependence of hopping probabilities, mean waiting times, and standard deviations on the hopping distance and on the intensity of ...
, Parrondo, , Martinez, , Kawai, , Lindenberg   +3 more
openaire   +2 more sources

Biased random walks on Galton–Watson trees

Probability Theory and Related Fields, 1996
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Lyons, Russell, Pemantle, Robin, Peres, Yuval   +2 more
openaire   +1 more source

Biased random walks on Kleinberg’s spatial networks

Physica A: Statistical Mechanics and its Applications, 2016
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Pan, Gui-Jun, Niu, Rui-Wu
openaire   +1 more source

Biased Random Walks in Uniform Wireless Networks

IEEE Transactions on Mobile Computing, 2009
A recurrent problem when designing distributed applications is to search for a node with known property. File searching in peer-to-peer (P2P) applications, resource discovery in service-oriented architectures (SOAs), and path discovery in routing can all be cast as a search problem.
openaire   +1 more source

Inference Using Biased Coin Randomization

2011
We provide a novel approach to approximate conditional randomization tests fol- lowing Efron's randomization procedure by sampling from the conditional reference set. We use combinatorial algebra to derive the conditional distribution of the num- ber of subjects randomized to a treatment. The result is a simple and e±cient Monte Carlo technique that is
openaire   +1 more source

Biasing in random number space

2006
An interesting way to compare the biased random number technique to more conventional biasing techniques is to consider what is really calculated by analog Monte-Carlo. Each history is associated with a random number sequence \(\vec r_i\) and a history score \(T(\vec r_i )\) that depends on the random walk specified by \(\vec r_i\).
openaire   +1 more source

Using biased randomization for solving the two-dimensional loading vehicle routing problem with heterogeneous fleet

Annals of Operations Research, 2016
Oscar L. Domínguez Rivero, A. Juan, Barry B. Barrios, J. Faulin, A. Agustín   +4 more
semanticscholar   +1 more source

Combining biased randomization with iterated local search for solving the multidepot vehicle routing problem

International Transactions in Operational Research, 2015
A. Juan, Iñaki Pascual, Daniel Guimarans, Barry B. Barrios   +3 more
semanticscholar   +1 more source

Optimizing Airline Crew Scheduling Using Biased Randomization: A Case Study

Conferencia de la Asociación Española para la Inteligencia Artificial, 2016
A. Agustín, Aljoscha Gruler, J. Armas, A. Juan   +3 more
semanticscholar   +1 more source