2343 search results - page 134 / 469 » The Locomotive Routing Problem |
157
Voted
FOCS
2006
IEEE
16 years 4 days ago
2006
IEEE
In this work we study a wide range of online and offline routing and packing problems with various objectives. We provide a unified approach, based on a clean primal-dual method...
180
click to vote
JAR
2000
15 years 5 months ago
2000
In this paper, we show how Guided Local Search (GLS) can be applied to the SAT problem and show how the resulting algorithm can be naturally extended to solve the weighted MAX-SAT ...
187
click to vote
MSWIM
2005
ACM
15 years 11 months ago
2005
ACM
In the last few years, the advance of multimedia applications has prompted researchers to undertake the task of routing multimedia data through Manet. This task is rather difficul...
149
Voted
DAC
2004
ACM
15 years 11 months ago
2004
ACM
As the technology migrates into the deep submicron manufacturing (DSM) era, the critical dimension of the circuits is getting smaller than the lithographic wavelength. The unavoid...
144
click to vote
INFOCOM
2003
IEEE
15 years 11 months ago
2003
IEEE
Abstract— Finding a path in a network based on multiple constraints (the MCP problem) is often referred to as QoS routing. QoS routing with constraints on multiple additive metri...