416 search results - page 7 / 84 » Approximation Algorithms for Reliable Stochastic Combinatori... |
126
Voted
CEC
2008
IEEE
15 years 9 months ago
2008
IEEE
: Differential evolutionary (DE) mutates solution vectors by the weighted difference of other vectors using arithmetic operations. As these operations cannot be directly extended t...
142
Voted
IRREGULAR
1995
Springer
15 years 6 months ago
1995
Springer
In this paper, we review parallel search techniques for approximating the global optimal solution of combinatorial optimization problems. Recent developments on parallel implementa...
146
Voted
SODA
2010
ACM
15 years 19 days 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...
105
Voted
ICPR
2010
IEEE
15 years 21 days ago
2010
IEEE
A novel stochastic searching scheme based on the Monte Carlo optimization is presented for polygonal approximation (PA) problem. We propose to combine the split-and-merge based lo...
147
Voted
AI
2002
Springer
15 years 2 months ago
2002
Springer
Combinatorial auctions, that is, auctions where bidders can bid on combinations of items, tend to lead to more efficient allocations than traditional auction mechanisms in multi-i...