Sciweavers

339 search results - page 15 / 68
» Is the Euclidean algorithm optimal among its peers
Sort
View
TEC
2010
112views more  TEC 2010»
13 years 3 months ago
Population-Based Algorithm Portfolios for Numerical Optimization
In this paper, we consider the scenario that a population-based algorithm is applied to a numerical optimization problem and a solution needs to be presented within a given time bu...
Fei Peng, Ke Tang, Guoliang Chen, Xin Yao
MICS
2007
90views more  MICS 2007»
13 years 8 months ago
Approximation by Conic Splines
Abstract. We show that the complexity of a parabolic or conic spline approximating a sufficiently smooth curve with non-vanishing curvature to within Hausdorff distance ε is c1ε...
Sunayana Ghosh, Sylvain Petitjean, Gert Vegter
SIGMETRICS
2011
ACM
140views Hardware» more  SIGMETRICS 2011»
12 years 11 months ago
On the stability and optimality of universal swarms
Recent work on BitTorrent swarms has demonstrated that a bandwidth bottleneck at the seed can lead to the underutilization of the aggregate swarm capacity. Bandwidth underutilizat...
Xia Zhou, Stratis Ioannidis, Laurent Massouli&eacu...
WWW
2008
ACM
14 years 9 months ago
Learning to rank relational objects and its application to web search
Learning to rank is a new statistical learning technology on creating a ranking model for sorting objects. The technology has been successfully applied to web search, and is becom...
Tao Qin, Tie-Yan Liu, Xu-Dong Zhang, De-Sheng Wang...
CEC
2008
IEEE
14 years 3 months ago
Dynamic adaptation and multiobjective concepts in a particle swarm optimizer for constrained optimization
— In this paper, we propose a novel approach to solve constrained optimization problems based on particle swarm optimization (PSO). First, an empirical comparison of the most pop...
Jorge Isacc Flores-Mendoza, Efrén Mezura-Mo...