Result 1 to 20 of 37 total
Unifying geometric, probabilistic, and potential field approaches to multi-robot coverage control. (English)
Pradalier, Cédric (ed.) et al., Robotics research. The 14th international symposium ISRR. Selected papers based on the presentations at the symposium, Lucerne, Switzerland, August 31st to September 3rd, 2009. Berlin: Springer (ISBN 978-3-642-19456-6/hbk; 978-3-642-19457-3/ebook). Springer Tracts in Advanced Robotics 70, 21-38 (2011).
1
A clustering-ensemble approach based on voting. (English)
Deng, Hepu (ed.) et al., Artificial intelligence and computational intelligence. Third international conference, AICI 2011, Taiyuan, China, September 24‒25, 2011. Proceedings, Part I. Berlin: Springer (ISBN 978-3-642-23880-2/pbk). Lecture Notes in Computer Science 7002. Lecture Notes in Artificial Intelligence, 421-427 (2011).
2
An axiomatization of the median procedure on the $n$-cube. (English)
Discrete Appl. Math. 159, No. 9, 939-944 (2011).
3
Cooperative distributed multi-agent optimization. (English)
Palomar, Daniel P. (ed.) et al., Convex optimization in signal processing and communications. Cambridge: Cambridge University Press (ISBN 978-0-521-76222-9/hbk). 340-386 (2010).
4
Axiomatic characterization of the mean function on trees. (English)
Discrete Math. Algorithms Appl. 2, No. 3, 313-329 (2010).
5
Weighted partition consensus via kernels. (English)
Pattern Recognition 43, No. 8, 2712-2724 (2010).
6
Clustering ensembles using ants algorithm. (English)
Mira, José (ed.) et al., Methods and models in artificial and natural computation. A homage to Professor Mira’s scientific legacy. Third international work-conference on the interplay between natural and artificial computation, IWINAC 2009, Santiago de Compostela, Spain, June 22‒26, 2009. Proceedings, Part I. Berlin: Springer (ISBN 978-3-642-02263-0/pbk). Lecture Notes in Computer Science 5601, 295-304 (2009).
7
The majority decision function for trees with 3 leaves. (English)
Ann. Oper. Res. 163, 169-175 (2008).
8
The median function on graphs with bounded profiles. (English)
Discrete Appl. Math. 156, No. 15, 2882-2889 (2008).
9
Weighted cluster ensemble using a kernel consensus function. (English)
Ruiz-Shulcloper, José (ed.) et al., Progress in pattern recognition, image analysis and applications. 13th Iberoamerican congress on pattern recognition, CIARP 2008, Havana, Cuba, September 9‒12, 2008. Proceedings. Berlin: Springer (ISBN 978-3-540-85919-2/pbk). Lecture Notes in Computer Science 5197, 195-202 (2008).
10
Examination of the similarity between a new sigmoid function-based consensus ranking method and four commonly-used algorithms. (English)
Int. J. Oper. Res. 3, No. 4, 384-398 (2008).
11
A comparison of three graph partitioning based methods for consensus clustering. (English)
Wang, Guoyin (ed.) et al., Rough sets and knowledge technology. First international conference, RSKT 2006, Chongqing, China, July 24‒26, 2006. Proceedings. Berlin: Springer (ISBN 978-3-540-36297-5/pbk). Lecture Notes in Computer Science 4062. Lecture Notes in Artificial Intelligence, 468-475 (2006).
12
Finding centroid clusterings with entropy-based criteria. (English)
Knowl. Inf. Syst. 10, No. 4, 505-514 (2006).
13
The $t$-median function on graphs. (English)
Discrete Appl. Math. 154, No. 18, 2599-2608 (2006).
14
Finding centroid clusterings with entropy-based criteria. (English)
Knowl. Inf. Syst. 10, No. 4, 505-514 (2006).
15
Consensus problems in discrete-time multiagent systems with fixed topology. (English)
J. Math. Anal. Appl. 322, No. 2, 587-598 (2006).
16
Consensus clustering. (English)
Intell. Data Anal. 9, No. 6, 551-565 (2005).
17
Similarity-based combination of multiple clusterings. (English)
Int. J. Comput. Intell. Appl. 5, No. 3, 351-369 (2005).
18
Fuzzy sets induced by consensus and set operations. (English)
Fuzzy Sets Syst. 78, No.3, 255-270 (1996).
19
The asymptotic plurality rule for molecular sequences. (English)
Math. Comput. Modelling 23, No.3, 27-42 (1996).
20
Result 1 to 20 of 37 total
Start
Contact
Print
General Help
