5316 search results - page 183 / 1064 » Which Search Problems Are Random |
133
Voted
GECCO
2007
Springer
15 years 10 months ago
2007
Springer
Dividing the set of nodes into clusters in the well-known traveling salesman problem results in the generalized traveling salesman problem which seeking a tour with minimum cost p...
128
click to vote
JC
2006
15 years 3 months ago
2006
We study the problem of multivariate integration over Rd with integrands of the form f(x)d(x) where d is a probability density function. Practical problems of this form occur comm...
127
Voted
EOR
2007
2007
Solving the short-term electrical generation scheduling problem by an adaptive evolutionary approach
15 years 3 months ago
In this paper, we introduce an adaptive evolutionary approach to solve the short-term electrical generation scheduling problem (STEGS). The STEGS is a hard constraint satisfaction...
125
Voted
INFORMATICALT
2006
15 years 3 months ago
2006
Recently, genetic algorithms (GAs) and their hybrids have achieved great success in solving difficult combinatorial optimization problems. In this paper, the issues related to the ...
154
Voted
JCSS
2002
15 years 3 months ago
2002
We present the first constant-factor approximation algorithm for the metric k-median problem. The k-median problem is one of the most well-studied clustering problems, i.e., those...