Sciweavers

239 search results - page 11 / 48
» Random walks in a supply network
Sort
View
FOCS
2009
IEEE
14 years 3 months ago
Faster Generation of Random Spanning Trees
In this paper, we set forth a new algorithm for generating approximately uniformly random spanning trees in undirected graphs. We show how to sample from a distribution that is wi...
Jonathan A. Kelner, Aleksander Madry
INFOCOM
2011
IEEE
13 years 4 days ago
Smart sleep: Sleep more to reduce delay in duty-cycled wireless sensor networks
A simple random walk (SRW) has been considered as an effective forwarding method for many applications in wireless sensor networks (WSNs) due to its desirable properties. However...
Chul-Ho Lee, Do Young Eun
EAAI
2008
115views more  EAAI 2008»
13 years 8 months ago
Supply chain coordination: A game-theory approach
In a supply chain organized as a network of autonomous enterprises, the main objective of each partner is to optimize his production and supply policy with respect to his own econ...
Jean-Claude Hennet, Yasemin Arda
IPL
2000
115views more  IPL 2000»
13 years 8 months ago
Randomized uniform self-stabilizing mutual exclusion
Abstract. The mutual exclusion protocol presented ensures that whatever perturbation the network undergo, it regains consistency in nite time: one and only one privilege token is p...
Jérôme Olivier Durand-Lose
WSC
2007
13 years 10 months ago
Using empirical demand data and common random numbers in an agent-based simulation of a distribution network
Agent-based simulation provides a methodology to investigate complex systems behavior, such as supply chains, while incorporating many empirical elements relative to both systems ...
William J. Sawaya