Sciweavers

1095 search results - page 89 / 219
» Preprocessing of Intractable Problems
Sort
View
INFOCOM
2002
IEEE
14 years 3 months ago
Exploiting OTDM technology in WDM networks
— Wavelength routed optical networks allow to design a logical topology, comprising lightpaths and routers, which is overlayed on the physical topology, comprising optical fiber...
Marco Mellia, Emilio Leonardi, Marco Feletig, Robe...
RTSS
2002
IEEE
14 years 3 months ago
Approximate Schedulability Analysis
The schedulability analysis problem for many realistic task models is intractable. Therefore known algorithms either have exponential complexity or at best can be solved in pseudo...
Samarjit Chakraborty, Simon Künzli, Lothar Th...
ESA
2006
Springer
126views Algorithms» more  ESA 2006»
14 years 1 months ago
Cooperative TSP
In this paper we introduce and study cooperative variants of the Traveling Salesperson Problem. In these problems a salesperson has to make deliveries to customers who are willing ...
Amitai Armon, Adi Avidor, Oded Schwartz
EVOW
2006
Springer
14 years 1 months ago
Divide-and-Evolve: A New Memetic Scheme for Domain-Independent Temporal Planning
An original approach, termed Divide-and-Evolve is proposed to hybridize Evolutionary Algorithms (EAs) with Operational Research (OR) methods in the domain of Temporal Planning Prob...
Marc Schoenauer, Pierre Savéant, Vincent Vi...
APPROX
2008
Springer
127views Algorithms» more  APPROX 2008»
14 years 6 days ago
Approximating Single Machine Scheduling with Scenarios
In the field of robust optimization, the goal is to provide solutions to combinatorial problems that hedge against variations of the numerical parameters. This constitutes an effor...
Monaldo Mastrolilli, Nikolaus Mutsanas, Ola Svenss...