Sciweavers

1754 search results - page 137 / 351
» The Computational Complexity of Delay Management
Sort
View
195
Voted
ATMOS
2010
128views Optimization» more  ATMOS 2010»
15 years 6 months ago
Robust Train Routing and Online Re-scheduling
Train Routing is a problem that arises in the early phase of the passenger railway planning process, usually several months before operating the trains. The main goal is to assign...
Alberto Caprara, Laura Galli, Leo G. Kroon, G&aacu...
179
Voted
CSL
2007
Springer
16 years 1 months ago
Game Characterizations and the PSPACE-Completeness of Tree Resolution Space
The Prover/Delayer game is a combinatorial game that can be used to prove upper and lower bounds on the size of Tree Resolution proofs, and also perfectly characterizes the space ...
Alexander Hertel, Alasdair Urquhart
BROADNETS
2006
IEEE
16 years 1 months ago
Graded Channel Reservation with Path Switching in Ultra High Capacity Networks
— We introduce a new algorithmic framework for advanced channel reservation in ultra high speed networks, called Graded Channel Reservation (GCR). GCR allows users to specify min...
Reuven Cohen, Niloofar Fazlollahi, David Starobins...
GI
2001
Springer
15 years 11 months ago
M-YESSIR: A Low Latency Reservation Protocol for Mobile-IP Networks
Abstract—Advanced network and media applications such as multimedia streaming and Internet telephony are becoming an integral part of the Internet. Reservation protocols, such as...
Hromuzd Khosravi, Daniel Reininger, Maximilian Ott...
230
Voted
DIS
2007
Springer
15 years 11 months ago
Time and Space Efficient Discovery of Maximal Geometric Graphs
A geometric graph is a labeled graph whose vertices are points in the 2D plane with an isomorphism invariant under geometric transformations such as translation, rotation, and scal...
Hiroki Arimura, Takeaki Uno, Shinichi Shimozono