Sciweavers

697 search results - page 105 / 140
» Convex Functions on Discrete Sets
Sort
View
CEC
2008
IEEE
14 years 3 months ago
Evolutionary Multi-objective Simulated Annealing with adaptive and competitive search direction
— In this paper, we propose a population-based implementation of simulated annealing to tackle multi-objective optimisation problems, in particular those of combinatorial nature....
Hui Li, Dario Landa Silva
ICCAD
1999
IEEE
113views Hardware» more  ICCAD 1999»
14 years 1 months ago
Attractor-repeller approach for global placement
Traditionally, analytic placement used linear or quadratic wirelength objective functions. Minimizing either formulation attracts cells sharing common signals (nets) together. The...
Hussein Etawil, Shawki Areibi, Anthony Vannelli
AAAI
2010
13 years 10 months ago
Smooth Optimization for Effective Multiple Kernel Learning
Multiple Kernel Learning (MKL) can be formulated as a convex-concave minmax optimization problem, whose saddle point corresponds to the optimal solution to MKL. Most MKL methods e...
Zenglin Xu, Rong Jin, Shenghuo Zhu, Michael R. Lyu...
IJON
2008
158views more  IJON 2008»
13 years 8 months ago
Blind separation of convolutive image mixtures
Convolutive mixtures of images are common in photography of semi-reflections. They also occur in microscopy and tomography. Their formation process involves focusing on an object ...
Sarit Shwartz, Yoav Y. Schechner, Michael Zibulevs...
TCOM
2010
197views more  TCOM 2010»
13 years 7 months ago
Power control for cooperative dynamic spectrum access networks with diverse QoS constraints
Dynamic spectrum access (DSA) is an integral part of cognitive radio technology aiming at efficient management of the available power and bandwidth resources. The present paper d...
Nikolaos Gatsis, Antonio G. Marqués, Georgi...