Page 1

Displaying 1 – 13 of 13

Showing per page

The estimation of electric power losses in electrical networks by fuzzy regression model using genetic algorithm.

A. V. Mogilenko, D. A. Pavlyuchenko (2004)

Mathware and Soft Computing

This paper presents the comparative study for fuzzy regression model using linear programming, fuzzy regression model using genetic algorithms and standard regression model. The fuzzy and standard models were developed for estimation of electric power losses in electrical networks. Simulation was carried out with a tool developed in MATLAB.

The HeKatE methodology. Hybrid engineering of intelligent systems

Grzegorz J. Nalepa, Antoni Ligęza (2010)

International Journal of Applied Mathematics and Computer Science

This paper describes a new approach, the HeKatE methodology, to the design and development of complex rule-based systems for control and decision support. The main paradigm for rule representation, namely, eXtended Tabular Trees (XTT), ensures high density and transparency of visual knowledge representation. Contrary to traditional, flat rule-based systems, the XTT approach is focused on groups of similar rules rather than on single rules. Such groups form decision tables which are connected into...

The logic of neural networks.

Juan Luis Castro, Enric Trillas (1998)

Mathware and Soft Computing

This paper establishes the equivalence between multilayer feedforward networks and linear combinations of Lukasiewicz propositions. In this sense, multilayer forward networks have a logic interpretation, which should permit to apply logical techniques in the neural networks framework.

The performance profile: A multi-criteria performance evaluation method for test-based problems

Wojciech Jaśkowski, Paweł Liskowski, Marcin Szubert, Krzysztof Krawiec (2016)

International Journal of Applied Mathematics and Computer Science

In test-based problems, solutions produced by search algorithms are typically assessed using average outcomes of interactions with multiple tests. This aggregation leads to information loss, which can render different solutions apparently indifferent and hinder comparison of search algorithms. In this paper we introduce the performance profile, a generic, domain-independent, multi-criteria performance evaluation method that mitigates this problem by characterizing the performance of a solution by...

The UD RLS algorithm for training feedforward neural networks

Jarosław Bilski (2005)

International Journal of Applied Mathematics and Computer Science

A new algorithm for training feedforward multilayer neural networks is proposed. It is based on recursive least squares procedures and U-D factorization, which is a well-known technique in filter theory. It will be shown that due to the U-D factorization method, our algorithm requires fewer computations than the classical RLS applied to feedforward multilayer neural network training.

Theoretical analysis of steady state genetic algorithms

Alexandru Agapie, Alden H. Wright (2014)

Applications of Mathematics

Evolutionary Algorithms, also known as Genetic Algorithms in a former terminology, are probabilistic algorithms for optimization, which mimic operators from natural selection and genetics. The paper analyses the convergence of the heuristic associated to a special type of Genetic Algorithm, namely the Steady State Genetic Algorithm (SSGA), considered as a discrete-time dynamical system non-generational model. Inspired by the Markov chain results in finite Evolutionary Algorithms, conditions are...

Time–dependent Simple Temporal Networks: Properties and Algorithms

Cédric Pralet, Gérard Verfaillie (2013)

RAIRO - Operations Research - Recherche Opérationnelle

Simple Temporal Networks (STN) allow conjunctions of minimum and maximum distance constraints between pairs of temporal positions to be represented. This paper introduces an extension of STN called Time–dependent STN (TSTN), which covers temporal constraints for which the minimum and maximum distances required between two temporal positions x and y are not necessarily constant but may depend on the assignments of x and y. Such constraints are useful to model problems in which the duration of an...

Towards a theory of practice in metaheuristics design: A machine learning perspective

Mauro Birattari, Mark Zlochin, Marco Dorigo (2006)

RAIRO - Theoretical Informatics and Applications

A number of methodological papers published during the last years testify that a need for a thorough revision of the research methodology is felt by the operations research community – see, for example, [Barr et al., J. Heuristics1 (1995) 9–32; Eiben and Jelasity, Proceedings of the 2002 Congress on Evolutionary Computation (CEC'2002) 582–587; Hooker, J. Heuristics1 (1995) 33–42; Rardin and Uzsoy, J. Heuristics7 (2001) 261–304]. In particular, the performance evaluation of nondeterministic methods,...

Currently displaying 1 – 13 of 13

Page 1