840 search results - page 130 / 168 » Inapproximability of Combinatorial Optimization Problems |
ESCIENCE
2006
IEEE
14 years 5 months ago
2006
IEEE
: A relatively new meta-heuristic, known as extremal optimisation (EO), is based on the evolutionary science notion that poorly performing genes of an individual are replaced by ra...
AAIM
2006
Springer
14 years 5 months ago
2006
Springer
In this note we deal with sensitivity analysis of combinatorial optimization problems and its fundamental term, the tolerance. For three classes of objective functions (Σ, Π, MA...
ICAC
2005
IEEE
14 years 4 months ago
2005
IEEE
Large data centers host several application environments (AEs) that are subject to workloads whose intensity varies widely and unpredictably. Therefore, the servers of the data ce...
ICOIN
2005
Springer
14 years 4 months ago
2005
Springer
Abstract. In optical networks, traffic demands often demonstrate periodic nature for which time-overlapping property can be utilized in routing and wavelength assignment (RWA). A R...
CP
2004
Springer
14 years 4 months ago
2004
Springer
Abstract. One of the most appealing features of constraint programming is its rich constraint language for expressing combinatorial optimization problems. This paper demonstrates t...