6 results for “version bench”

Set a search alert

Research ArticleOpen accessIn the abstractAdvantage of Classical Approximate Analytical Methods for Studying Rydberg States Over the Quantum CounterpartsEugene OksIn studies of atomic and molecular systems, approximate analytical methods play a significant role. This is because they can be used for benchmarking the results of numerical methods. Besides they offer a physical insight into the phenomena under consideration an insight impossible to achieve by numerical methods. Many approximate analytical methods were developed in such a way that each method … …Physics International, Vol. 14, Issue 1 · 2 Jul 2024 · 8,014 accessesView PDF Cite

Research ArticleOpen accessIn the abstractDESIGN AND DEVELOPMENT OF A RECOMMENDER SYSTEM FOR E-LEARNING MODULESBaseera, SrinathExtensive literature review revealed that, different recommender systems for E-learning were developed. A preliminary version of the development was undertaken and evaluated in an experiment during an introduction psychology course in an open university. The activities were integrated in to a model which operates on a network. No curriculum structure was assigned and the users were allowed to undergo learning … …Journal of Computer Science, Vol. 10, Issue 5 · 26 Dec 2013 · 7,104 accessesView PDF Cite

Research ArticleOpen accessIn the abstractSlime Mould Reproduction: A New Optimization Algorithm for Constrained Engineering ProblemsRajalakshmi Sakthivel, Kanmani SelvaduraiIn recent explorations of biologically inspired optimization strategies, the Slime Mould Reproduction (SMR) algorithm emerges as an innovative meta-heuristic optimization technique. This algorithm is deeply rooted in the reproductive dynamics observed in slime molds, particularly the intricate balance these organisms strike between local and global spore dispersal. By replicating this balance, the SMR algorithm deftly navigates between exploration and exploitation … …Journal of Computer Science, Vol. 20, Issue 1 · 21 Dec 2023 · 5,946 accessesView PDF Cite

Research ArticleOpen accessIn the abstractNEW BINARY PARTICLE SWARM OPTIMIZATION WITH IMMUNITY-CLONAL ALGORITHMAmr Badr, Mostafa Abd El Azeim, Dina EL-GammalParticle Swarm Optimization used to solve a continuous problem and has been shown to perform well however, binary version still has some problems. In order to solve these problems a new technique called New Binary Particle Swarm Optimization using Immunity-Clonal Algorithm (NPSOCLA) is proposed This Algorithm proposes a new updating strategy to update the position vector in Binary Particle Swarm … …Journal of Computer Science, Vol. 9, Issue 11 · 30 Sep 2013 · 6,801 accessesView PDF Cite

Research ArticleOpen accessIn the abstractHybridization of Genetic Algorithm with Parallel Implementation of Simulated Annealing for Job Shop SchedulingThamilselvan Rakkiannan, Balasubramanie PalanisamyProblem statement: The Job Shop Scheduling Problem (JSSP) is observed as one of the most difficult NP-hard, combinatorial problem. The problem consists of determining the most efficient schedule for jobs that are processed on several machines. Approach: In this study Genetic Algorithm (GA) is integrated with the parallel version of Simulated Annealing Algorithm (SA) is applied to the job shop … …American Journal of Applied Sciences, Vol. 9, Issue 10 · 25 Aug 2012 · 7,062 accessesView PDF Cite

Research ArticleOpen accessIn the abstractComparative Performance Analysis of Mobile IPv6 Protocols: Special Reference to Simultaneous BindingsShariq Haseeb, Ahmad F. IsmailMobile IP is the Internet Engineering Task Force (IETF) proposal to cater for All-Internet Protocol (All-IP) mobility. It forms the backbone for next generation Wireless Internet Technology to provide uninterrupted network service while on the move. Our paper conducts a performance study of the various Mobile Internet Protocol version 6 (IPv6) protocols such as Simple Mobile IPv6, Hierarchical Mobile IPv6, … …Journal of Computer Science, Vol. 2, Issue 2 · 28 Feb 2006 · 7,867 accessesView PDF Cite