25 search results - page 2 / 5 » Differential evolution for discrete optimization: An experim... |
SODA
2010
ACM
13 years 2 months ago
2010
ACM
Consider the following problem: given a metric space, some of whose points are "clients," select a set of at most k facility locations to minimize the average distance f...
ATAL
2006
Springer
13 years 6 months ago
2006
Springer
Bidding for multiple items or bundles on online auctions raises challenging problems. We assume that an agent has a valuation function that returns its valuation for an arbitrary ...
CEC
2008
IEEE
13 years 11 months ago
2008
IEEE
—Ant Colony Optimization (ACO) algorithm is a novel meta-heuristic algorithm for the approximate solution of combinatorial optimization problems that has been inspired by the for...
ICML
2007
IEEE
14 years 5 months ago
2007
IEEE
We study the problem of learning kernel machines transductively for structured output variables. Transductive learning can be reduced to combinatorial optimization problems over a...
CEC
2007
IEEE
13 years 11 months ago
2007
IEEE
— Most reported studies on differential evolution (DE) are obtained using low-dimensional problems, e.g., smaller than 100, which are relatively small for many real-world problem...