Sciweavers

1191 search results - page 55 / 239
» Completeness and Performance Of The APO Algorithm
Sort
View
ALENEX
2009
172views Algorithms» more  ALENEX 2009»
13 years 7 months ago
Rank Aggregation: Together We're Strong
We consider the problem of finding a ranking of a set of elements that is "closest to" a given set of input rankings of the elements; more precisely, we want to find a p...
Frans Schalekamp, Anke van Zuylen
KDD
2012
ACM
201views Data Mining» more  KDD 2012»
11 years 11 months ago
Low rank modeling of signed networks
Trust networks, where people leave trust and distrust feedback, are becoming increasingly common. These networks may be regarded as signed graphs, where a positive edge weight cap...
Cho-Jui Hsieh, Kai-Yang Chiang, Inderjit S. Dhillo...
ICPR
2008
IEEE
14 years 3 months ago
Improvement on Mean Shift based tracking using second-order information
Object tracking based on Mean Shift (MS) algorithm has been very successful and thus receives significant research interests. Unfortunately, traditional MS based tracking only ut...
Lijuan Xiao, Peihua Li
MASCOTS
2010
13 years 7 months ago
Efficient Web Requests Scheduling Considering Resources Sharing
Requests scheduling in Web servers is a hot research topic. Many works aim at providing optimal algorithms according to various metrics. Most of these works are based on classical ...
Simon Duquennoy, Gilles Grimaud
CEC
2008
IEEE
14 years 3 months ago
Asynchronous multiple objective particle swarm optimisation in unreliable distributed environments
Abstract— This paper examines the performance characteristics of both asynchronous and synchronous parallel particle swarm optimisation algorithms in heterogeneous, fault-prone e...
Ian Scriven, David Ireland, Andrew Lewis, Sanaz Mo...