Sciweavers

1815 search results - page 70 / 363
» Path Planning for Network Performance
Sort
View
EOR
2006
107views more  EOR 2006»
14 years 12 months ago
Longest path analysis in networks of queues: Dynamic scheduling problems
In this paper, we develop an acyclic network of queues for the design of a dynamic flow shop, where each service station represents a machine. The orders arrive at the input stati...
Amir Azaron, Hideki Katagiri, Kosuke Kato, Masatos...
IROS
2007
IEEE
198views Robotics» more  IROS 2007»
15 years 6 months ago
Topological mapping, localization and navigation using image collections
Abstract— In this paper we present a highly scalable visionbased localization and mapping method using image collections. A topological world representation is created online dur...
Friedrich Fraundorfer, Christopher Engels, David N...
NCA
2005
IEEE
15 years 5 months ago
Fundamental Network Processor Performance Bounds
In this paper, fundamental conditions which bound the network processing unit (NPU) worst-case performance are established. In particular, these conditions formalize and integrate...
Hao Che, Chethan Kumar, Basavaraj Menasinahal
ASIAMS
2007
IEEE
15 years 6 months ago
Solving Shortest Capacitated Path Problem Using a Bi-Objective Heuristic Approach
The shortest capacitated path problem is a well known problem in the networking area, having a wide range of applications. In the shortest capacitated path problem, a traffic flow...
Crina Grosan, Ajith Abraham
INFOCOM
2006
IEEE
15 years 6 months ago
Performance of VoIP in a 802.11 Wireless Mesh Network
— Performance in multihop wireless networks is known to degrade with the number of hops for both TCP and UDP traffic. For VoIP, the wireless network presents additional challeng...
Dragor Niculescu, Samrat Ganguly, Kyungtae Kim, Ra...