2343 search results - page 132 / 469 » The Locomotive Routing Problem |
122
click to vote
GLOBECOM
2008
IEEE
15 years 9 months ago
2008
IEEE
—Most research works in routing and design of optical networks assume that the optical medium can carry signals without any bit error. However, the physical impairments on the op...
117
click to vote
IPPS
1998
IEEE
15 years 7 months ago
1998
IEEE
This work deals with the scheduling problem of a directed acyclic graph with interprocessor communication delays. The objective is to minimize the makespan, taking into account the...
245
click to vote
ICC
2011
IEEE
14 years 2 months ago
2011
IEEE
—Ant colony optimization (ACO) is a probabilistic technique used for solving complex computational problems, such as finding optimal routes in networks. It has been proved to pe...
119
click to vote
ISCC
2005
IEEE
15 years 8 months ago
2005
IEEE
The problem of computing bandwidth guaranteed paths for given flow requests in an ad-hoc network is complicated because neighboring links share the medium. We define the path wi...
128
click to vote
ICDCS
1998
IEEE
15 years 7 months ago
1998
IEEE
We address the problem of efficient circuit switching in wide area networks. The solution provided is based on finding optimal routes for lightpaths and semilightpaths. A lightpat...