Sciweavers

866 search results - page 84 / 174
» On Dynamic Shortest Paths Problems
Sort
View
BROADNETS
2007
IEEE
14 years 2 months ago
Reduced flow routing: Leveraging residual capacity to reduce blocking in GMPLS networks
— Traffic engineering has been extensively studied to maximize network resource utilization while minimizing call blocking [1]. As the the demand for high data rate services ove...
Xiaolan J. Zhang, Sun-il Kim, Steven S. Lumetta
ISCAS
1994
IEEE
117views Hardware» more  ISCAS 1994»
13 years 12 months ago
Design of a Fast Sequential Decoding Algorithm Based on Dynamic Searching Strategy
This paper presents a new sequential decoding algorithm based on dynamic searching strategy to improve decoding efficiency. The searching strategy is to exploit both sorting and p...
Wen-Wei Yang, Li-Fu Jeng, Chen-Yi Lee
COMGEO
1999
ACM
13 years 7 months ago
Dynamic algorithms for geometric spanners of small diameter: Randomized solutions
Let S be a set of n points in IRd and let t > 1 be a real number. A t-spanner for S is a directed graph having the points of S as its vertices, such that for any pair p and q o...
Sunil Arya, David M. Mount, Michiel H. M. Smid
ICRA
1998
IEEE
157views Robotics» more  ICRA 1998»
13 years 12 months ago
Motion Planning for a 3-DOF Robot with a Passive Joint
This paper studies motion planning from one zero velocity state to another for a three-joint robot in a horizontal plane witha passive revolute third joint. Such a robot is small-...
Kevin M. Lynch, Naoji Shiroma, Hirohiko Arai, Kazu...
IOR
2008
109views more  IOR 2008»
13 years 7 months ago
Polynomial-Time Algorithms for Stochastic Uncapacitated Lot-Sizing Problems
In 1958, Wagner and Whitin published a seminal paper on the deterministic uncapacitated lot-sizing problem, a fundamental model that is embedded in many practical production plann...
Yongpei Guan, Andrew J. Miller