PDF Archive search engine
Last database update: 07 May at 20:58 - Around 220000 files indexed.
Results for «algorithms»:
Total: 900 results - 0.04 seconds
DesignAadAnalysisSOfAlgorithmsUnit1 Design and Analysis of Algorithms 10CS43 UNIT – 1 INTRODUCTION 1.1 Notion of Algorithm Need for studying algorithms:
UNIT-1 QB 99%
The fundamental steps are Understanding the problem Ascertain the capabilities of computational device Choose between exact and approximate problem solving Decide on appropriate data structures Algorithm design techniques Methods for specifying the algorithm Proving an algorithms correctness Analyzing an algorithm Coding an algorithm State the Euclid’s algorithm for finding GCD of two given numbers.
www.elsevier.com/locate/eswa Bio inspired computing – A review of algorithms and scope of applications Arpan Kumar Kar∗ Information Systems area, DMS, Indian Institute of Technology Delhi, Hauz Khas, Outer Ring Road, New Delhi 110016 India a r t i c l e i n f o Article history:
Comparison of modern heuristic algorithms for loss reduction in power distribution network equipped with renewable energy resources 98%
Comparison of modern heuristic algorithms for loss reduction in power distribution network equipped with renewable energy resources Ain Shams Engineering Journal xxx (xxxx) xxx Contents lists available at ScienceDirect Ain Shams Engineering Journal journal homepage:
Simple and practical bit-vector algorithms have been designed for this problem, most notably the one used in agrep.
Adaptive Genetic Algorithms (AGAs) have been built that dynamically adjust selected control parameters during the course of evolving a problem solution.
genetic algorithms paper USIG GEETIC ALGORITHMS FOR TEST CASE GEERATIO AD SELECTIO OPTIMIZATIO Izzat Alsmadi Yarmouk University ABSTRACT Genetic Algorithms (GAs) are adaptive search techniques that imitate the processes of evolution to solve optimization problems when traditional methods are considered too costly in terms of processing time and output effectiveness.
Science, Bharathiar University, Coimbatore, India 2 Vice Principal, KGISL Institute of Technology, KGISL campus, Coimbatore, India ABSTRACT Abstract - Clustering algorithms is a process of break up the data objects into numerous groups which is similar.
Formal Asymptotic Analysis of Online Scheduling Algorithms for Plug-In Electric Vehicles’ Charging 95%
Formal Asymptotic Analysis of Online Scheduling Algorithms for Plug In Electric Vehicles’ Charging energies Article Formal Asymptotic Analysis of Online Scheduling Algorithms for Plug-In Electric Vehicles’ Charging Asad Ahmed 1, *,† , Osman Hasan 1,† , Falah Awwad 2 , Nabil Bastaki 2 and Syed Rafay Hasan 3 1 2 3 * † School of Electrical Engineering and Computer Science, National University of Sciences and Technology (NUST), H-12 Islamabad, Pakistan;
DesignAadAnalysisSOfAlgorithmsSyllabus DESIGN AND ANALYSIS OF ALGORITHMS (Common to CSE &
DesignAadAnalysisSOfAlgorithmsUnit5 Design and Analysis of Algorithms 10CS43 UNIT-5 DECREASE-AND-CONQUER APPROACHES, SPACE-TIMETRADEOFFS 5.1 Decrease and conquer :Introduction Decrease &
In all communication algorithms we need the carrier.
MBtree paper 94%
Previous algorithms assume a constant quantizer in each frame and rely on impractically slow approaches, such as repeatedly encoding each frame dozens of times.
EM Algorithms 94%
EM Algorithms How Everyday Mathematics Uses Multiple Algorithms To Help Students Learn More Meaningful Math Everyday Mathematics is a structured, rigorous and proven program that helps students learn mathematical reasoning and develop strong math skills.
2231-1963 AN ENERGY EFFICIENT CONTROL STRATEGY FOR INDUCTION MACHINES BASED ON ADVANCED PARTICLE SWARM OPTIMISATION ALGORITHMS Duy C.
Introduction K-Means clustering is one of the most reliable unsupervised learning data mining algorithms used as a workaround to the famous clustering problem that had previously been considered to be noncomputational.
In this work, we present our experience when developing the Matching Framework (MaF), a framework for matching ontologies that allows users to conﬁgure their own ontology matching algorithms and it allows developers to perform research on new complex algorithms.