Sciweavers

339 search results - page 12 / 68
» Is the Euclidean algorithm optimal among its peers
Sort
View
ESWA
2010
158views more  ESWA 2010»
13 years 6 months ago
Interval competitive agglomeration clustering algorithm
1 In this study, a novel robust clustering algorithm, robust interval competitive agglomeration (RICA) clustering algorithm, is proposed to overcome the problems of the outliers, t...
Jin-Tsong Jeng, Chen-Chia Chuang, Chin-Wang Tao
ICTAI
1997
IEEE
14 years 25 days ago
Toward the Optimization of a Class of Black Box Optimization Algorithms
Many black box optimization algorithms have sufcient exibility to allow them to adapt to the varying circumstances they encounter. These capabilities are of two primary sorts: 1) ...
Gang Wang, Erik D. Goodman, William F. Punch III
FMN
2009
Springer
99views Multimedia» more  FMN 2009»
14 years 3 months ago
Interest-Based Peer-to-Peer Group Management
Abstract. Peer-to-Peer systems become popular applications but suffer from insufficient resource availability which is caused by free-riders and inefficient lookup algorithms. To a...
Jun Lei, Xiaoming Fu
HPDC
2008
IEEE
14 years 3 months ago
Improving peer connectivity in wide-area overlays of virtual workstations
Self-configuring virtual networks rely on structured P2P routing to provide seamless connectivity among nodes through overlay routing of virtual IP packets, support decentralized...
Arijit Ganguly, P. Oscar Boykin, David Wolinsky, R...
CORR
2011
Springer
160views Education» more  CORR 2011»
13 years 3 months ago
When is social computation better than the sum of its parts?
good solutions to complex problems. In many examples, individuals trying to solve superior global solution. This suggests that there may be general principles of information aggre...
Vadas Gintautas, Aric A. Hagberg, Luís M. A...