Sciweavers

315 search results - page 21 / 63
» Shortest path optimization under limited information
Sort
View
AAAI
2000
13 years 9 months ago
Collective Intelligence and Braess' Paradox
We consider the use of multi-agent systems to control network routing. Conventional approaches to this task are based on Ideal Shortest Path routing Algorithm (ISPA), under which ...
Kagan Tumer, David Wolpert
RSS
2007
176views Robotics» more  RSS 2007»
13 years 9 months ago
Active Policy Learning for Robot Planning and Exploration under Uncertainty
Abstract— This paper proposes a simulation-based active policy learning algorithm for finite-horizon, partially-observed sequential decision processes. The algorithm is tested i...
Ruben Martinez-Cantin, Nando de Freitas, Arnaud Do...
ISMIR
2005
Springer
141views Music» more  ISMIR 2005»
14 years 1 months ago
Rhythm-Based Segmentation of Popular Chinese Music
We present a new method to segment popular music based on rhythm. By computing a shortest path based on the self-similarity matrix calculated from a model of rhythm, segmenting bo...
Kristoffer Jensen, Jieping Xu, Martin Zachariasen
INFOCOM
1997
IEEE
14 years 3 days ago
A Distributed Algorithm for Delay-Constrained Unicast Routing
In this paper, we study the NP-hard delay-constrained least-cost path problem. A solution to this problem is needed to provide real-time communication service to connection-orient...
Hussein F. Salama, Douglas S. Reeves, Yannis Vinio...
GLOBECOM
2009
IEEE
13 years 11 months ago
Multi-Path Key Establishment against REM Attacks in Wireless Ad Hoc Networks
Secure communications in wireless ad hoc networks require setting up end-to-end secret keys for communicating node pairs. Due to physical limitations and scalability requirements, ...
Tian Lan, Ruby B. Lee, Mung Chiang