Sciweavers

17770 search results - page 296 / 3554
» A Generalization of Forward-Backward Algorithm
Sort
View
CEC
2007
IEEE
16 years 1 months ago
Incrementally maximising hypervolume for selection in multi-objective evolutionary algorithms
— Several multi-objective evolutionary algorithms compare the hypervolumes of different sets of points during their operation, usually for selection or archiving purposes. The ba...
Lucas Bradstreet, R. Lyndon While, Luigi Barone
ACIVS
2006
Springer
16 years 1 months ago
Alternative Fuzzy Clustering Algorithms with L1-Norm and Covariance Matrix
In fuzzy clustering, the fuzzy c-means (FCM) algorithm is the best known and most used method. Although FCM is a very useful method, it is sensitive to noise and outliers so that W...
Miin-Shen Yang, Wen-Liang Hung, Tsiung-Iou Chung
IPSN
2004
Springer
16 years 19 days ago
Locally constructed algorithms for distributed computations in ad-hoc networks
In this paper we develop algorithms for distributed computation of a broad range of estimation and detection tasks over networks with arbitrary but fixed connectivity. The distri...
Dzulkifli S. Scherber, Haralabos C. Papadopoulos
IPPS
1993
IEEE
15 years 11 months ago
New Wormhole Routing Algorithms for Multicomputers
Abstract. Development of wormhole routing techniques so far has been largely independent of the results available for store-and-forward routing in literature. In this paper, we pro...
Rajendra V. Boppana, Suresh Chalasani
ESA
2006
Springer
103views Algorithms» more  ESA 2006»
15 years 11 months ago
Greedy in Approximation Algorithms
The objective of this paper is to characterize classes of problems for which a greedy algorithm finds solutions provably close to optimum. To that end, we introduce the notion of k...
Julián Mestre