Benders decomposition for local access network design with two technologies.
Randazzo, C.D., Luna, H.P.L., Mahey, P. (2001)
Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only]
Similarity:
Randazzo, C.D., Luna, H.P.L., Mahey, P. (2001)
Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only]
Similarity:
Sebastian Marius Roşu, George Drăgoi (2011)
Computer Science and Information Systems
Similarity:
Radomir Prodanović, Dejan Simić (2006)
Computer Science and Information Systems
Similarity:
Milan Zdravković, Miroslav Trajanović (2009)
Computer Science and Information Systems
Similarity:
Margaris, Athanasios, Kotsialos, Efthymios, Styliadis, Athansios, Roumeliotis, Manos (2004)
Acta Universitatis Apulensis. Mathematics - Informatics
Similarity:
Gâta, Marieta (2005)
Acta Universitatis Apulensis. Mathematics - Informatics
Similarity:
Nenad Dulanović, Dane Hinić, Dejan Simić (2008)
The Yugoslav Journal of Operations Research
Similarity:
Lim, J.-T., Meerkov, S.M. (1996)
Mathematical Problems in Engineering
Similarity:
Anabela Tereso, João Mota, Rui Lameiro (2006)
Control and Cybernetics
Similarity:
Filip Ponulak (2008)
International Journal of Applied Mathematics and Computer Science
Similarity:
In this paper we perform an analysis of the learning process with the ReSuMe method and spiking neural networks (Ponulak, 2005; Ponulak, 2006b). We investigate how the particular parameters of the learning algorithm affect the process of learning. We consider the issue of speeding up the adaptation process, while maintaining the stability of the optimal solution. This is an important issue in many real-life tasks where the neural networks are applied and where the fast learning convergence...