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...
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...
In this paper, fundamental conditions which bound the network processing unit (NPU) worst-case performance are established. In particular, these conditions formalize and integrate...
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...
— 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...