Your selections:

Show More

Show Less

- Balbuena, Camino, Barker, Ewan, Lin, Yuqing, Miller, Mirka, Sugeng, Kiki Ariyanti

**Authors:**Balbuena, Camino , Barker, Ewan , Lin, Yuqing , Miller, Mirka , Sugeng, Kiki Ariyanti**Date:**2006**Type:**Text , Journal article**Relation:**Discrete Mathematics Vol. 306, no. 16 (2006), p. 1817-1829**Full Text:**false**Reviewed:****Description:**Let G be a graph of order n and size e. A vertex-magic total labeling is an assignment of the integers 1, 2, ..., n + e to the vertices and the edges of G, so that at each vertex, the vertex label and the labels on the edges incident at that vertex, add to a fixed constant, called the magic number of G. Such a labeling is a-vertex consecutive magic if the set of the labels of the vertices is { a + 1, a + 2, ..., a + n }, and is b-edge consecutive magic if the set of labels of the edges is { b + 1, b + 2, ..., b + e }. In this paper we prove that if an a-vertex consecutive magic graph has isolated vertices then the order and the size satisfy (n - 1)**Description:**C1**Description:**2003001604

Canonical duality for radial basis neural networks

- Latorre, Vittorio, Gao, David

**Authors:**Latorre, Vittorio , Gao, David**Date:**2013**Type:**Text , Journal article**Relation:**Advances in Intelligent Systems and Computing Vol. 212, no. (2013), p. 1189-1197**Full Text:**false**Reviewed:****Description:**Radial Basis Function Neural Networks (RBF NN) are a tool largely used for regression problems. The principal drawback of this kind of predictive tool is that the optimization problem solved to train the network can be non-convex. On the other hand Canonical Duality Theory offers a powerful procedure to reformulate general non-convex problems in dual forms so that it is possible to find optimal solutions and to get deep insights into the nature of the challenging problems. By combining the canonical duality theory with the RBF NN, this paper presents a potentially useful method for solving challenging problems in real-world applications. © Springer-Verlag Berlin Heidelberg 2013. Proceedings of the Eighth International Conference on Bio-Inspired Computing: Theories and Applications (BIC-TA), 2013.**Description:**2003011221

A comparative study of state transition algorithm with harmony search and artificial bee colony

- Zhou, Xiaojun, Gao, David, Yang, Chunhua

**Authors:**Zhou, Xiaojun , Gao, David , Yang, Chunhua**Date:**2013**Type:**Text , Journal article**Relation:**Advances in Intelligent Systems and Computing Vol. 212, no. (2013), p. 651-659**Full Text:**false**Reviewed:****Description:**We focus on a comparative study of three recently developed nature-inspired optimization algorithms, including state transition algorithm, harmony search and artificial bee colony. Their core mechanisms are introduced and their similarities and differences are described. Then, a suit of 27 well-known benchmark problems are used to investigate the performance of these algorithms and finally we discuss their general applicability with respect to the structure of optimization problems. Â© Springer-Verlag Berlin Heidelberg 2013.**Description:**2003011220

- «
- ‹
- 1
- ›
- »

Are you sure you would like to clear your session, including search history and login status?