Sciweavers

2343 search results - page 104 / 469
» The Locomotive Routing Problem
Sort
View
CORR
2007
Springer
93views Education» more  CORR 2007»
13 years 10 months ago
Solving the Hamiltonian path problem with a light-based computer
Abstract. In this paper we suggest the use of light for performing useful computations. Namely, we propose a special computational device which uses light rays for solving the Hami...
Mihai Oltean
CORR
2007
Springer
95views Education» more  CORR 2007»
13 years 10 months ago
Solving the subset-sum problem with a light-based device
We propose a special computational device which uses light rays for solving the subset-sum problem. The device has a graph-like representation and the light is traversing it by fol...
Mihai Oltean, Oana Muntean
MMS
1998
13 years 9 months ago
The Multimedia Multicasting Problem
This paper explores the problems associated with the multicasting of continuous media to support multimedia group applications. The interaction between multicasting and the deliver...
Joseph Pasquale, George C. Polyzos, George Xylomen...
CISS
2008
IEEE
14 years 4 months ago
Revisiting the optimal scheduling problem
— In this paper, we revisit the problem of determining the minimum-length schedule that satisfies certain traffic demands in a wireless network. Traditional approaches for the ...
Sastry Kompella, Jeffrey E. Wieselthier, Anthony E...
ISAAC
2001
Springer
112views Algorithms» more  ISAAC 2001»
14 years 2 months ago
On the Complexity of Train Assignment Problems
We consider a problem faced by train companies: How can trains be assigned to satisfy scheduled routes in a cost efficient way? Currently, many railway companies create solutions b...
Thomas Erlebach, Martin Gantenbein, Daniel Hü...