840 search results - page 79 / 168 » Inapproximability of Combinatorial Optimization Problems |
100
click to vote
PPSN
1992
Springer
15 years 4 months ago
1992
Springer
This paper introduces a new optimization technique called hyperplane annealing. It is similar to the mean field annealing approach to combinatorial optimization. Both annealing te...
GECCO
2007
Springer
15 years 6 months ago
2007
Springer
Artificial Immune System algorithms use antibodies which fully specify the solution of an optimization, learning, or pattern recognition problem. By being restricted to fully spec...
MASCOTS
2003
15 years 1 months ago
2003
The Web proxy cache placement problem is often formulated as a classical optimization problem: place N proxies within an internetwork so as to minimize the average user response t...
105
click to vote
GECCO
2005
Springer
15 years 6 months ago
2005
Springer
We focus on the handling of overlapping solutions in evolutionary multiobjective optimization (EMO) algorithms. First we show that there exist a large number of overlapping soluti...
101
Voted
ICTAI
1999
IEEE
15 years 4 months ago
1999
IEEE
Recently, there has been much interest in enhancing purely combinatorial formalisms with numerical information. For example, planning formalisms can be enriched by taking resource...