Sciweavers

497 search results - page 55 / 100
» Approximating max-min linear programs with local algorithms
Sort
View
GECCO
2006
Springer
179views Optimization» more  GECCO 2006»
15 years 1 months ago
Local search for multiobjective function optimization: pareto descent method
Genetic Algorithm (GA) is known as a potent multiobjective optimization method, and the effectiveness of hybridizing it with local search (LS) has recently been reported in the li...
Ken Harada, Jun Sakuma, Shigenobu Kobayashi
ICCV
2007
IEEE
15 years 4 months ago
Laplacian PCA and Its Applications
Dimensionality reduction plays a fundamental role in data processing, for which principal component analysis (PCA) is widely used. In this paper, we develop the Laplacian PCA (LPC...
Deli Zhao, Zhouchen Lin, Xiaoou Tang
CODES
2007
IEEE
15 years 4 months ago
Locality optimization in wireless applications
There is a strong need now for compilers of embedded systems to find effective ways of optimizing series of loop-nests, wherein majority of the memory references occur in the fo...
Javed Absar, Min Li, Praveen Raghavan, Andy Lambre...
EAAI
2007
199views more  EAAI 2007»
14 years 9 months ago
Nonlinear system modeling and robust predictive control based on RBF-ARX model
An integrated modeling and robust model predictive control (MPC) approach is proposed for a class of nonlinear systems with unknown steady state. First, the nonlinear system is id...
Hui Peng, Zi-Jiang Yang, Weihua Gui, Min Wu, Hideo...
CVPR
2009
IEEE
15 years 1 months ago
Nonnegative Matrix Factorization with Earth Mover's Distance metric
Nonnegative Matrix Factorization (NMF) approximates a given data matrix as a product of two low rank nonnegative matrices, usually by minimizing the L2 or the KL distance between ...
Roman Sandler, Michael Lindenbaum