Sciweavers

1186 search results - page 22 / 238
» Improving Random Walk Performance
Sort
View
CN
2007
122views more  CN 2007»
13 years 11 months ago
Impact of mobility on the performance of relaying in ad hoc networks - Extended version
— We consider a mobile ad hoc network consisting of three types of nodes: source, destination, and relay nodes. All the nodes are moving over a bounded region with possibly diffe...
Ahmad Al Hanbali, Arzad Alam Kherani, Robin Groene...
CORR
2010
Springer
102views Education» more  CORR 2010»
13 years 5 months ago
Superior Exploration-Exploitation Balance with Quantum-Inspired Hadamard Walks
This paper extends the analogies employed in the development of quantum-inspired evolutionary algorithms by proposing quantum-inspired Hadamard walks, called QHW. A novel quantum-...
Sisir Koppaka, Ashish Ranjan Hota
INFOCOM
2009
IEEE
14 years 5 months ago
Budget-Based Self-Optimized Incentive Search in Unstructured P2P Networks
—Distributed object search is the primary function of Peer-to-Peer (P2P) file sharing system to locate and transfer the file. The predominant search schemes in unstructured P2P...
Yi Hu, Min Feng, Laxmi N. Bhuyan, Vana Kalogeraki
NPL
2002
178views more  NPL 2002»
13 years 10 months ago
Walking on Virtual Tiles
Abstract. This paper examines the application of virtual reality cues, generating the biofeedback effects of a real tiled floor, reported in [8], for gait improvement in Parkinson&...
Yoram Baram, Judith Aharon-Peretz, Yahalomit Simio...
FOCS
2006
IEEE
14 years 5 months ago
Fast Algorithms for Logconcave Functions: Sampling, Rounding, Integration and Optimization
We prove that the hit-and-run random walk is rapidly mixing for an arbitrary logconcave distribution starting from any point in the support. This extends the work of [26], where t...
László Lovász, Santosh Vempal...