Sciweavers

1263 search results - page 124 / 253
» A* with Bounded Costs
Sort
View
ISAAC
2004
Springer
115views Algorithms» more  ISAAC 2004»
14 years 3 months ago
Multicriteria Global Minimum Cuts
We consider two multicriteria versions of the global minimum cut problem in undirected graphs. In the k-criteria setting, each edge of the input graph has k non-negative costs ass...
Amitai Armon, Uri Zwick
INFOCOM
2003
IEEE
14 years 3 months ago
Optimal Sliding-Window Strategies in Networks with Long Round-Trip Delays
— A method commonly used for packet flow control over connections with long round-trip delays is “sliding windows”. In general, for a given loss rate, a larger window size a...
Lavy Libman, Ariel Orda
NETWORKING
2004
13 years 11 months ago
Traffic Grooming in WDM Ring Networks with the Min-Max Objective
We consider the problem of traffic grooming in WDM ring networks. Previous studies have focused on minimizing aggregate representations of the network cost. In this work, we consid...
Bensong Chen, George N. Rouskas, Rudra Dutta
CORR
2010
Springer
134views Education» more  CORR 2010»
13 years 9 months ago
Incremental Sampling-based Algorithms for Optimal Motion Planning
During the last decade, incremental sampling-based motion planning algorithms, such as the Rapidly-exploring Random Trees (RRTs), have been shown to work well in practice and to po...
Sertac Karaman, Emilio Frazzoli
CN
2006
82views more  CN 2006»
13 years 9 months ago
A cost-minimization algorithm for fast location tracking in mobile wireless networks
Location tracking is one of the most important issues in providing real-time applications over wireless networks due to its effect to quality of service (QoS), such as end-to-end ...
Wenye Wang, Guoliang Xue