Results 241 to 250 of about 4,228,165 (285)
Some of the next articles are maybe not open access.
A Forwarding Migration Algorithm for Multipath Transmission
2009 IEEE International Symposium on Parallel and Distributed Processing with Applications, 2009According to the new features of traffic distribution, a novel forwarding migration algorithm (FMA) is proposed. Programmable routers (PR) are used in FMA. One PR sets FMA bit for unbalanced traffic. Another PR forwards related traffic to the FMA link rather than to wait for matching the longest address prefix.
Laiquan Han +3 more
openaire +2 more sources
Monarch Migration Algorithm for optimization problems
2015 IEEE International Conference on Industrial Engineering and Engineering Management (IEEM), 2015In this work, we intend to formulate a new metaheuristic algorithm, called Monarch Migration Algorithm (MMA), for solving optimization problems. This algorithm is based on the migratory behavior of the monarch butterflies. We validate the proposed algorithm against various unimodal and multi-modal test functions.
Kaushik Kumar Bhattacharjee +1 more
openaire +1 more source
Parallel genetic algorithms with schema migration
Proceedings 26th Annual International Computer Software and Applications, 2003Genetic algorithms (GAs) are efficient non-gradient stochastic search methods. Parallel GAs are proposed to overcome the deficiencies of sequential GAs, such as low speed and aptness to locally converge. However the tremendous communication cost incurred offsets the advantages of parallel GAs.
Baowen Xu +3 more
openaire +1 more source
Extended PGA for range migration algorithms
IEEE Transactions on Aerospace and Electronic Systems, 2006The phase gradient autofocus (PGA) algorithm is extended to work for synthetic aperture radar (SAR) spotlight images processed with range migration (w-k) algorithms. Several pre-processing steps are proposed for aligning the range-compressed phase-history data needed for successful autofocusing of the data.
Rossum, W.L. van +2 more
openaire +2 more sources
The benefit of migration in parallel evolutionary algorithms
Proceedings of the 12th annual conference on Genetic and evolutionary computation, 2010Parallelization is becoming a more and more important issue for solving difficult optimization problems. Various implementations of parallel evolutionary algorithms (EAs) have been applied in the past decades. Island models combine phases of independent evolution with migration where genetic information is spread out to neighbored islands.
Jörg Lässig, Dirk Sudholt
openaire +1 more source
Network Migration Optimization Using Genetic Algorithms [PDF]
Lecture Notes in Computer Science, 2012 This paper introduces the problem of communication network migration for backbone networks. Heuristic solutions for this problem can be determined by the application of genetic algorithms to the problem. A description of the system model is presented, as well as the used algorithmic approaches and optimization results. Our main goal is the optimization
Ralf Lehnert, Stefan Türk
exaly +3 more sources
Seismic migration algorithms on parallel computers
Proceedings of the third conference on Hypercube concurrent computers and applications -, 1988Seismic signal processing is computationally intensive and sequential algorithms in use do not exploit the concurrency inherent in data migration techniques. In this paper we study seismic migration algorithms with a view to present a general framework for analyzing such algorithms and propose some coarse-grained paradigms for computation on parallel ...
Vijay K. Madisetti +1 more
openaire +3 more sources
Randomized Algorithms for Multiprocessor Page Migration
SIAM Journal on Computing, 1992The page migration problem is to manage a globally addressed shared memory in a multiprocessor system. Each physical page of memory is located at a given processor, and memory references to that page by other processors incur a cost proportional to the network distance.
openaire +2 more sources
Migration of holes: Numerical algorithms and implementation
The Journal of Chemical Physics, 2007A hole created in a system, for instance by ionization, can migrate through the system solely driven by many-electron effects. The implementation of the theory of charge migration and the numerical algorithms used are described in detail. A description of the ab initio calculation of charge migration in realistic systems is presented for several ...
J, Breidbach, L S, Cederbaum
openaire +2 more sources
Improved Algorithms for Dynamic Page Migration
2005The dynamic page migration problem [4] is defined in a distributed network of n mobile nodes sharing one indivisible memory page of size D. During runtime, the nodes can both access a unit of data from the page and move with a constant speed, thus changing the costs of communication.
Marcin Bienkowski +2 more
openaire +1 more source