Sciweavers

4354 search results - page 203 / 871
» Classification-based objective functions
Sort
View
CDC
2008
IEEE
124views Control Systems» more  CDC 2008»
16 years 28 days ago
A proximal center-based decomposition method for multi-agent convex optimization
— In this paper we develop a new dual decomposition method for optimizing a sum of convex objective functions corresponding to multiple agents but with coupled constraints. In ou...
Ion Necoara, Johan A. K. Suykens
INFOCOM
2006
IEEE
16 years 14 days ago
On the Performance of Joint Rate/Power Control with Adaptive Modulation in Wireless CDMA Networks
Abstract— Adaptive rate/power control schemes have great potential to increase the throughput of wireless CDMA networks. In this paper, we investigate the additional gains achiev...
Alaa Muqattash, Tao Shu, Marwan Krunz
EMMCVPR
2005
Springer
15 years 12 months ago
Increasing Efficiency of SVM by Adaptively Penalizing Outliers
In this paper, a novel training method is proposed to increase the classification efficiency of support vector machine (SVM). The efficiency of the SVM is determined by the number ...
Yiqiang Zhan, Dinggang Shen
IMR
2003
Springer
15 years 11 months ago
Combined Laplacian and Optimization-based Smoothing for Quadratic Mixed Surface Meshes
Quadratic elements place stringent requirements on a surface mesh smoother. One of the biggest challenges is that a good linear element may become invalid when mid-side nodes are ...
Zhijian Chen, Joseph R. Tristano, Wa Kwok
GECCO
2006
Springer
153views Optimization» more  GECCO 2006»
15 years 10 months ago
On the local performance of simulated annealing and the (1+1) evolutionary algorithm
Simulated annealing and the (1+1) EA, a simple evolutionary algorithm, are both general randomized search heuristics that optimize any objective function with probability
Thomas Jansen, Ingo Wegener