1013 search results - page 13 / 203 » A Subexponential Algorithm for Abstract Optimization Problem... |
119
click to vote
IPPS
2000
IEEE
15 years 10 months ago
2000
IEEE
Abstract. In this paper, we consider parallelizability of some Pcomplete problems. First we propose a parameter which indicates parallelizability for a convex layers problem. We pr...
156
click to vote
ICNC
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. Small populations are very desirable for reducing the required computational resources in evolutionary optimization of complex real-world problems. Unfortunately, the sea...
186
click to vote
EWSN
2009
Springer
16 years 6 months ago
2009
Springer
Abstract. In their EWSN'07 paper [1], Giusti et al. proposed a decentralized wake-up scattering algorithm for temporally spreading the intervals in which the nodes of a wirele...
142
click to vote
WEA
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. Extensions of the randomized tournaments techniques introduced in [6, 7] to approximate solutions of 1-median and diameter computation of finite subsets of general metri...
184
click to vote
FOCI
2007
IEEE
15 years 9 months ago
2007
IEEE
Abstract-- In this paper, we empirically analyze the convergence behavior of evolutionary algorithms (evolution strategies