791 resultados para approximation algorithm
Resumo:
Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)
Resumo:
Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)
Resumo:
This paper introduces an improved tabu-based vector optimal algorithm for multiobjective optimal designs of electromagnetic devices. The improvements include a division of the entire search process, a new method for fitness assignment, a novel scheme for the generation and selection of neighborhood solutions, and so forth. Numerical results on a mathematical function and an engineering multiobjective design problem demonstrate that the proposed method can produce virtually the exact Pareto front, in both parameter and objective spaces, even though the iteration number used by it is only about 70% of that required by its ancestor.
Resumo:
We introduce a generalization of the relativistic eikonal amplitude originally developed to describe elastic scattering between structureless particles. The coherent and incoherent proton-nucleus scattering processes are analysed and closed-form expressions for elastic and inelastic amplitudes are derived. In particular, for the incoherent case, an energy-conserving version of Glauber's theory is obtained.
Resumo:
A novel constructive heuristic algorithm to the network expansion planning problem is presented the basic idea comes from Garver's work applied to the transportation model, nevertheless the proposed algorithm is for the DC model. Tests results with most known systems in the literature are carried out to show the efficiency of the method.
Resumo:
Function approximation is a very important task in environments where computation has to be based on extracting information from data samples in real world processes. Neural networks and wavenets have been recently seen as attractive tools for developing efficient solutions for many real world problems in function approximation. In this paper, it is shown how feedforward neural networks can be built using a different type of activation function referred to as the PPS-wavelet. An algorithm is presented to generate a family of PPS-wavelets that can be used to efficiently construct feedforward networks for function approximation.
Resumo:
We present results for low- and medium-energy elastic and capture cross sections for positronium-atom-alkali-ion scattering using the coupled static close-coupling approximation.
Resumo:
A constructive heuristic algorithm to solve the transmission system expansion planning problem is proposed with the aim of circumventing some critical problems of classical heuristic algorithms that employ relaxed mathematical models to calculate a sensitivity index that guides the circuit additions. The proposed heuristic algorithm is in a branch-and-bound algorithm structure, which can be used with any planning model, such as Transportation model, DC model, AC model or Hybrid models. Tests of the proposed algorithm are presented on real Brazilian systems.
Resumo:
Two applications of the modified Chebyshev algorithm are considered. The first application deals with the generation of orthogonal polynomials associated with a weight function having singularities on or near the end points of the interval of orthogonality. The other application involves the generation of real Szego polynomials.
Resumo:
The unitary pole approximation is used to construct a separable representation for a potential U which consists of a Coulomb repulsion plus an attractive potential of the Yamaguchi type. The exact bound-state wave function is employed. U is chosen as the potential which binds the proton in the 1d5/2 single-particle orbit in F-17. Using the separable representation derived for U, and assuming a separable Yamaguchi potential to describe the 1d5/2 neutron in O-17, the energies and wave functions of the ground state (1+) and the lowest 0+ state of F-18 are calculated in the Gore-plus-two-nucleons model solving the Faddeev equations.