Sciweavers

2343 search results - page 328 / 469
» The Locomotive Routing Problem
Sort
View
STOC
2003
ACM
193views Algorithms» more  STOC 2003»
16 years 5 months ago
Space efficient dynamic stabbing with fast queries
In dynamic stabbing, we operate on a dynamic set of intervals. A stabbing query asks for an interval containing a given point. This basic problem encodes problems such as method l...
Mikkel Thorup
INFOCOM
2009
IEEE
15 years 11 months ago
SDL Constructions of FIFO, LIFO and Absolute Contractors
— Despite all the recent advances in the mathematical theories for constructing optical queues by optical Switches and fiber Delay Lines (SDL), there are still many problems tha...
Cheng-Shang Chang, Jay Cheng, Duan-Shin Lee
130
Voted
INFOCOM
2009
IEEE
15 years 11 months ago
Impairment-Aware Offline RWA for Transparent Optical Networks
—We consider the offline version of the routing and wavelength assignment (RWA) problem in transparent all-optical networks. In such networks and in the absence of regenerators, ...
Konstantinos Manousakis, Kostas Christodoulopoulos...
ACSC
2007
IEEE
15 years 11 months ago
Mutually Visible Agents in a Discrete Environment
As computer controlled entities are set to move and explore more complex environments they need to be able to perform navigation tasks, like finding minimal cost routes. Much wor...
Joel Fenwick, Vladimir Estivill-Castro
PDP
2005
IEEE
15 years 10 months ago
Some Solutions for Peer-to-Peer Global Computing
the emergence of Internet and new kind of architecture, likepeer-to-peer (P2P) networks, provides great hope for distributed computation. However, the combination of the world of ...
Guillaume Jourjon, Didier El Baz