Sciweavers

644 search results - page 66 / 129
» Decomposition Complexity
Sort
View
78
Voted
ISICA
2007
Springer
15 years 6 months ago
On the Performance of Metamodel Assisted MOEA/D
Abstract. MOEA/D is a novel and successful Multi-Objective Evolutionary Algorithms(MOEA) which utilizes the idea of problem decomposition to tackle the complexity from multiple obj...
Wudong Liu, Qingfu Zhang, Edward P. K. Tsang, Cao ...
113
Voted
STOC
2009
ACM
181views Algorithms» more  STOC 2009»
16 years 1 months ago
The detectability lemma and quantum gap amplification
The quantum analog of a constraint satisfaction problem is a sum of local Hamiltonians - each (term of the) Hamiltonian specifies a local constraint whose violation contributes to...
Dorit Aharonov, Itai Arad, Zeph Landau, Umesh V. V...
110
Voted
ICRA
2007
IEEE
134views Robotics» more  ICRA 2007»
15 years 7 months ago
A Strategy for Vision-Based Controlled Pushing of Microparticles
— In this paper, a strategy for controlled pushing is presented for microassembly of 4.5 μm polystyrene particles on a flat glass substrate using an atomic force microscope prob...
Nicholas A. Lynch, Cagdas D. Onal, Eugenio Schuste...
103
Voted
ECML
2004
Springer
15 years 6 months ago
Inducing Polynomial Equations for Regression
Regression methods aim at inducing models of numeric data. While most state-of-the-art machine learning methods for regression focus on inducing piecewise regression models (regres...
Ljupco Todorovski, Peter Ljubic, Saso Dzeroski
86
Voted
WCNC
2008
IEEE
15 years 7 months ago
Simulation of Doubly-Selective Compound K Fading Channels for Mobile-to-Mobile Communications
A computer simulation model is proposed for discretetime doubly-selective compound-K fading channel. It first generates multiple independent mobile-to-mobile Rayleigh fading Chan...
Yuan Liu, Jian Zhang, Yahong Rosa Zheng