Now showing items 31-40 of 16937
A new parallel training algorithm for optimum-path forest-based learning
In this work, we present a new parallel-driven approach to speed up Optimum-Path Forest (OPF) training phase. In addition, we show how to make OPF up to five times faster for training using a simple parallel-friendly data ...
A Study of the Effectiveness of the Routing Decision Support Algorithm
(World Academy of Science, Engineering and Technology, 2007)
A Levinson algorithm based on an isometric transformation of Durbin`s
(IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC, 2008)
Starting from the Durbin algorithm in polynomial space with an inner product defined by the signal autocorrelation matrix, an isometric transformation is defined that maps this vector space into another one where the ...
A Review of String Matching Algorithms and Recent Implementations using GPU
String matching algorithms are an important element used in several computer science bb fields. These algorithms process strings of characters to find coincidences. The amount of processing required for modern applications ...
New Optimization Algorithms for Structural Reliability Analysis
(TECH SCIENCE PRESSNORCROSS, 2012)
Solution of structural reliability problems by the First Order method require optimization algorithms to find the smallest distance between a limit state function and the origin of standard Gaussian space. The Hassofer-L ...
Using GPU to exploit parallelism on cryptography
In this article we explore the NVIDIA graphical processing units (GPU) computational power in cryptography using CUDA (Compute Unified Device Architecture) technology. CUDA makes the general purpose computing easy using ...
Money in trees: How memes, trees, and isolation can optimize financial portfolios
(Elsevier Science IncNew YorkEUA, 2012)
A self-learning simulated annealing algorithm for global optimizations of electromagnetic devices
(Institute of Electrical and Electronics Engineers (IEEE), 2000-07-01)
A self-learning simulated annealing algorithm is developed by combining the characteristics of simulated annealing and domain elimination methods. The algorithm is validated by using a standard mathematical function and ...
A branch-and-bound algorithm for the multi-stage transmission expansion planning
This work presents a branch-and-bound algorithm to solve the multi-stage transmission expansion planning problem. The well known transportation model is employed, nevertheless the algorithm can be extended to hybrid models ...
Genetic algorithm of chu and beasley for static and multistage transmission expansion planning
In this paper the genetic algorithm of Chu and Beasley (GACB) is applied to solve the static and multistage transmission expansion planning problem. The characteristics of the GACB, and some modifications that were done, ...