Buscar
Mostrando ítems 31-40 de 2473
Algorithms for network piecewise-linear programs: A comparative study
(1997-02-16)
Piecewise-Linear Programming (PLP) is an important area of Mathematical Programming and concerns the minimisation of a convex separable piecewise-linear objective function, subject to linear constraints. In this paper a ...
Methodology for automatic selection of passes in surface grinding
(2007-01-01)
The main purpose of this work is the development of computational tools in order to assist the on-line automatic detection of burn in the surface grinding process. Most of the parameters currently employed in the burning ...
CALMANT: A Systematic Method for the Execution of Hypercube Algorithms in Multiprocessor Systems
(Computación y Sistemas, 2009)
Simplified computational routine to correct the modal decoupling in transmission lines and power systems modelling
(2013-07-31)
Modal analysis is widely approached in the classic theory of power systems modelling. This technique is also applied to model multiconductor transmission lines and their self and mutual electrical parameters. However, this ...
Fundamentos de otimização por inteligência de enxames: uma visão geral
(Sociedade Brasileira de Automática, 2009-09-01)
Este artigo apresenta uma breve revisão de alguns dos mais recentes métodos bioinspirados baseados no comportamento de populações para o desenvolvimento de técnicas de solução de problemas. As metaheurísticas tratadas aqui ...
A survey of evolutionary algorithms for decision-tree induction
(IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INCPISCATAWAY, 2012)
This paper presents a survey of evolutionary algorithms that are designed for decision-tree induction. In this context, most of the paper focuses on approaches that evolve decision trees as an alternate heuristics to the ...
String-averaging expectation-maximization for maximum likelihood estimation in emission tomography
(Iop Publishing Ltd, 2014-05-01)
We study the maximum likelihood model in emission tomography and propose a new family of algorithms for its solution, called string-averaging expectation maximization (SAEM). In the string-averaging algorithmic regime, the ...
AN EFFICIENT ALGORITHM FOR THE CLASSICAL LEAST SQUARES APPROXIMATION
(Siam Publications, 2020-01-01)
We explore the computational issues concerning a new algorithm for the classical least-squares approximation of N samples by an algebraic polynomial of degree at most n when the number N of the samples is very large. The ...
Computing the Sparsity Pattern of Hessians Using Automatic Differentiation
(Assoc Computing MachineryNew YorkEUA, 2014)