Sciweavers

7303 search results - page 1132 / 1461
» Optimality for dynamic patterns
Sort
View
JSAC
2007
107views more  JSAC 2007»
15 years 4 months ago
Admission control in data transfers over lightpaths
—The availability of optical network infrastructure and appropriate user control software has recently made it possible for scientists to establish end-to-end circuits across mul...
Wojciech M. Golab, Raouf Boutaba
CCE
2004
15 years 4 months ago
An algorithmic framework for improving heuristic solutions: Part II. A new version of the stochastic traveling salesman problem
The algorithmic framework developed for improving heuristic solutions of the new version of deterministic TSP [Choi et al., 2002] is extended to the stochastic case. To verify the...
Jaein Choi, Jay H. Lee, Matthew J. Realff
CN
2002
195views more  CN 2002»
15 years 4 months ago
A simulation study of the OSPF-OMP routing algorithm
Open shortest path first (OSPF) is the most widely used internal gateway routing protocol on the Internet. However, one shortcoming is that it does not take advantage of the exist...
G. Michael Schneider, Tamás Németh
ICRA
2010
IEEE
151views Robotics» more  ICRA 2010»
15 years 2 months ago
Trajectory prediction in cluttered voxel environments
Abstract— Trajectory planning and optimization is a fundamental problem in articulated robotics. It is often viewed as a two phase problem of initial feasible path planning aroun...
Nikolay Jetchev, Marc Toussaint
179
Voted
INFOCOM
2010
IEEE
15 years 2 months ago
Distributed Resource Allocation for Synchronous Fork and Join Processing Networks
—Many emerging information processing applications require applying various fork and join type operations such as correlation, aggregation, and encoding/decoding to data streams ...
Haiquan (Chuck) Zhao, Cathy H. Xia, Zhen Liu, Dona...
« Prev « First page 1132 / 1461 Last » Next »