Sciweavers

2343 search results - page 389 / 469
» The Locomotive Routing Problem
Sort
View
JSAC
2006
157views more  JSAC 2006»
15 years 4 months ago
Traffic grooming in path, star, and tree networks: complexity, bounds, and algorithms
We consider the problem of traffic grooming in WDM path, star, and tree networks. Traffic grooming is a variant of the well-known logical topology design, and is concerned with the...
Shu Huang, Rudra Dutta, George N. Rouskas
PRL
2006
221views more  PRL 2006»
15 years 4 months ago
Towards on-line saccade planning for high-resolution image sensing
This paper considers the problem of designing an active observer to plan a sequence of decisions regarding what target to look at, through a foveal-sensing action. We propose a fr...
Alberto Del Bimbo, Federico Pernici
SCHEDULING
2008
89views more  SCHEDULING 2008»
15 years 4 months ago
On-line decision support for take-off runway scheduling with uncertain taxi times at London Heathrow airport
: This paper addresses the challenge of building an automated decision support methodology to tackle the complex problem faced every day by runway controllers at London Heathrow Ai...
Jason A. D. Atkin, Edmund K. Burke, John S. Greenw...
CORR
2010
Springer
152views Education» more  CORR 2010»
15 years 2 months ago
Applications of Geometric Algorithms to Reduce Interference in Wireless Mesh Network
In wireless mesh networks such as WLAN (IEEE 802.11s) or WMAN (IEEE 802.11), each node should help to relay packets of neighboring nodes toward gateway using multi-hop routing mec...
Hung-Chin Jang
TIT
2011
149views more  TIT 2011»
14 years 11 months ago
Network Coding for Computing: Cut-Set Bounds
Abstract—The following network computing problem is considered. Source nodes in a directed acyclic network generate independent messages and a single receiver node computes a tar...
Rathinakumar Appuswamy, Massimo Franceschetti, Nik...