Sciweavers

434 search results - page 39 / 87
» Improved Algorithms for the 2-Vertex Disjoint Paths Problem
Sort
View
TON
2008
125views more  TON 2008»
14 years 11 months ago
Two techniques for fast computation of constrained shortest paths
Abstract-- Computing constrained shortest paths is fundamental to some important network functions such as QoS routing, which is to find the cheapest path that satisfies certain co...
Shigang Chen, Meongchul Song, Sartaj Sahni
INFOCOM
2009
IEEE
15 years 6 months ago
Diverse Routing in Networks with Probabilistic Failures
—We develop diverse routing schemes for dealing with multiple, possibly correlated, failures. While disjoint path protection can effectively deal with isolated single link failur...
Hyang-Won Lee, Eytan Modiano
113
Voted
ICRA
2010
IEEE
145views Robotics» more  ICRA 2010»
14 years 10 months ago
Reinforcement learning of motor skills in high dimensions: A path integral approach
— Reinforcement learning (RL) is one of the most general approaches to learning control. Its applicability to complex motor systems, however, has been largely impossible so far d...
Evangelos Theodorou, Jonas Buchli, Stefan Schaal
ICDM
2006
IEEE
116views Data Mining» more  ICDM 2006»
15 years 5 months ago
Improving Personalization Solutions through Optimal Segmentation of Customer Bases
On the Web, where the search costs are low and the competition is just a mouse click away, it is crucial to segment the customers intelligently in order to offer more targeted and...
Tianyi Jiang, Alexander Tuzhilin
SODA
2008
ACM
96views Algorithms» more  SODA 2008»
15 years 1 months ago
Unconditionally reliable message transmission in directed networks
In the unconditionally reliable message transmission (URMT) problem, two non-faulty players, the sender S and the receiver R are part of a synchronous network modeled as a directe...
Bhavani Shankar, Prasant Gopal, Kannan Srinathan, ...