14548 search results - page 378 / 2910 » The Optimal Path-Matching Problem |
180
click to vote
EVOW
2007
Springer
15 years 10 months ago
2007
Springer
RND (Radio Network Design) is a Telecommunication problem consisting in covering a certain geographical area by using the smallest number of radio antennas achieving the biggest co...
188
click to vote
GECCO
2006
Springer
15 years 10 months ago
2006
Springer
This paper presents a novel approach to solve the constrained unit commitment problem using Selective Self-Adaptive Ant System (SSAS) for improving search performance by automatic...
202
click to vote
ICCAD
1997
IEEE
15 years 11 months ago
1997
IEEE
We introduce a new technique to solve exactly a discrete optimization problem, based on the paradigm of “negative” thinking. The motivation is that when searching the space of...
168
click to vote
CORR
2006
Springer
15 years 6 months ago
2006
Springer
In multi-criteria optimization, several objective functions are to be optimized. Since the different objective functions are usually in conflict with each other, one cannot conside...
185
click to vote
GECCO
2003
Springer
15 years 12 months ago
2003
Springer
We present a Kernighan-Lin style local improvement heuristic for genetic algorithms. We analyze the run-time cost of the heuristic. We demonstrate through experiments that the heur...