An Estimation of Distribution Algorithm for solving the Knapsack problem
|
|
- Marvin O’Brien’
- 5 years ago
- Views:
Transcription
1 Vol.4,No.5, 214 Published olie: May 25, 214 DOI: /jscse.v4.5.1 A Estimatio of Distributio Algorithm for solvig the Kapsack problem 1 Ricardo Pérez, 2 S. Jös, 3 Arturo Herádez, 4 Carlos A. Ochoa *1, PICYTCIATEC A.C., Leó City, México 2, CONACYT, México City, México 3 CIMAT A.C., Guaajuato City, México 4 UACJ, Ciudad Juárez City, México 1 rperez.picyt@ciatec.mx, 2 jos_sachez@hotmail.com, 3 artha@cimat.mx, 4 alberto.ochoa@uacj.mx Abstract. The kapsack problem, a NPhard problem, has bee solved by differet ways durig may years. However, its combiatorial ature is still iterestig for may academics. I this paper, a Estimatio of Distributio Algorithm is applied for solvig the Kapsack problem. for simplicity is called. It cotais a probabilistic model of type chai for samplig ew offsprigs to solve the problem. I additio, we use a ad a to compare the performace of the algorithm. Accordig to the experimets, the geetic algorithm ad the provide good solutios, but the performace from this evolutioary algorithm was able to give better results. Keywords: Estimatio of Distributio Algorithm, Kapsack problem, geetic algorithm, greedy algorithm. * Correspodig Author: Ricardo Pérez Rodríguez, Posgrado Iteristitucioal e Ciecia y Tecología PICYT, CIATEC, A.C., México, rperez.picyt@ciatec.mx Tel: Itroductio Evolutioary ad metaheuristic algorithms have bee extesively used as search ad optimizatio tools durig this decade i several domais from sciece to egieerig, ad others. May demadig applicatios that ivolve the solutio of optimizatio problems of high complexity, a lot of these belogig to a special class of problems called NPhard have bee solved by various methods [1]. Evolutioary ad metaheuristic algorithms are ow cosidered amog the best tools to fid good solutios with a reasoable ivestmet of resources. Estimatio of Distributio Algorithms (EDAs), itroduced by Mühlebei ad Paaβ [2] have bee used satisfactorily to solve complex combiatorial optimizatio problems. Che et al [3], Liu et al [4] ad Pa ad Ruiz [5] ca be cosulted. Disadvatages of EDAs such as loss of diversity ad isufficiet use of locatio iformatio of solutios have bee tackled successfully by icorporatig other methods such as s (GAs) durig the evolutioary process. Che et al [6] use this approach. Several works have bee doe i order to capture the problem structure with more precisio. Advaced probabilistic models to solve combiatorial problems through EDAs have bee proposed attemptig to itegrate higher order iteractios to ehace the solutio quality. Wag et al [7] ad Che et al [8] have cotributed o it. The major procedure of a EDA is listed as follows. 78
2 Vol.4,No.5, 214 Published olie: May 25, 214 DOI: /jscse.v4.5.1 Step 1. Set the geeratio idex g =. Iitialize a iitial populatio S() of size M. Step 2. Select a subset D from S(g) of size N, where N M. Step 3. Establish a probabilistic model P which somehow describes the distributio characteristics of D. Step 4. Geerate a set K of ew idividuals by samplig P. Step 5. Select the best idividuals from K S(g) ad assig them to the ext geeratio S(g+1). Step 6. Let g = g+1. If g<gn, where GN is the maximum umber of geeratios retur step 2. Otherwise, output the best solutio i S(g). The Kapsack problem is a classical combiatorial problem [9][1]. It ca be described as follows: Imagie takig a trip to which you ca oly carry a backpack that, logically, has a limited capacity. Give a set of items, each with a weight ad a value, determie the umber of each item to iclude i a bag so that the total weight is less tha a give limit ad the total value is as large as possible, this problem ca be cosiderate as NPeasy problem but some studies show that the Kapsack problem is a NPhard problem [11]. I the preset paper we itroduce the Estimatio of Distributio Algorithm for solvig the Kapsack problem called for simplicity. The experimets were made o four types of istaces from ucorrelated to subsetsum. All these istaces probe the algorithm varyig the parameters of the profits ad the weight. It was ecessary to have a compariso poit for the ad was used the [9], this is a determiistic algorithm who gives a approximate result for the Kapsack problem. I additio, a or GA was used i order to compare the performace amog them. 2. The Kapsack problem The Kapsack problem [1] is the typical combiatorial problem that has bee studied sice may years ago ad was proved that it is a NPhard problem [12]. The basic problem is the 1 Kapsack problem or Biary Kapsack problem ad it has a search space of 2 1 possible solutios. The Kapsack Problem ca be described as follows: there are objects, each of this objects have a profit ad weight, ad eeds to select those whose sum of their beefits is maximized subject to the sum of the weight of the same objects should ot exceed a amout determied. It ca be formulated mathematically by umberig each of its objects or items from 1 to ad itroducig it to a vector of biary variables = 1,2,3,...,, where each variable represeted here will take the value 1 or depedig o whether it is selected or ot. The solutio to the Kapsack problem is select a subset of objects from the biary vector, solutio vector, that satisfies the costrait o the equatio (2) ad the same time maximize the objective fuctio o the equatio (1). z = j =1 p j x j (1) j =1 w j x j c x j = if the j object is selected otherwise (2) where z represets the profit j represets the jth object x j idicates whether the j object is part of the solutio p j is the jth object profit w j is the jth object weight 79
3 Vol.4,No.5, 214 Published olie: May 25, 214 DOI: /jscse.v4.5.1 c is the volume or capacity of the kapsack 3. Types of Kapsack problem istaces The Kapsack Problem is affected by the relatioship betwee the profit ad the weight of the objects; these types of istaces are the followig: Ucorrelated: the profits ad weight are distributed uiformly betwee oe ad a maximum T umber. p j 1, T ; w j 1, T (3) Weakly correlated: the weight is distributed uiformly betwee oe ad a maximum T umber ad the profits are distributed uiformly aroud the weight ad a R ratio. w j 1, T ; p j w j R, w j + R (4) Strogly correlated: the weight is uiformly distributed betwee oe ad a maximum T umber; the profits are the weight plus oe K costat. w j 1, T ; p j = w j + K (5) Subsetsum: the profits ad weight have the same value ad are distributed uiformly betwee oe ad a maximum T umber. w j 1, T ; p j = w j (6) 4. The This algorithm gives a ituitive approach cosiderig the profit ad weight of each item; it is kow as the efficiecy which is based o the Equatio (7). The objective is to try to put the items with highest efficiecy ito the Kapsack. It is ecessary sort all the items based o the efficiecy, usig the Equatio (8), before to apply the Greedy algorithm to the problem. e j = p j w j (7) p w p 1 w 1 p w (8) 5. for the kapsack problem Our approach is to use the MIMIC algorithm to build the probabilistic graph model. Itroduced by De Boet et al [13], the MIMIC algorithm uses a chai structured probabilistic model where the probability distributio of all the variables except the head ode is coditioed o the value of the variable precedig them i the chai. It meas a margial uivariate fuctio ad 1 pairs of coditioal desity fuctios to build the probabilistic graph model. Solutio represetatio: ay solutio of the problem metioed should be a specific biary vector that represets the objects i the kapsack. Thus, a solutio ca be expressed by or 1 for each object accordig to sectio 2. Probability model: I this paper, the probability model is desiged as a probability matrix. The elemet p j of the probability matrix represets the probability that the object j be loaded i the kapsack. For all j (j = 1, 2, ), p j is iitialized as 8
4 Vol.4,No.5, 214 Published olie: May 25, 214 p j = j =1 x j = 1 DOI: /jscse.v4.5.1 (9) where represets the umber of elemets. Via samplig accordig to the probability matrix ew promisig idividuals may be geerated. 6. Experimets To test the was used the Geerator of Kapsack Test Istaces [14]; it requires the umber of elemets ad the coefficiets rage to geerate a test istace. We geerate the four types of test istaces described, ad was used the same parameters for each. Each algorithm was ru 1 times for obtaiig their average ad stadard deviatio. The Table 1 shows the parameters used i this research. Table 1. Parameters used for solvig the Kapsack problem Parameters Values Geerator of Kapsack Test Istaces Number of items or elemets Rage of Coefficiets Number of istaces Number of test i series Type of selectio Cross rate Mutatio rate Probabilistic Model Touramet of size 2 8% 1% Structure of type chai 7. Results We show the results obtaied by testig each type istaces with the differet algorithms, i.e., the average, the best ad the worst profit, ad their fitess's stadard deviatio for each algorithm. We also show the algorithms behavior through some graphics. Ucorrelated: the Table 2 depicts the results for all algorithms where the offers the best std. deviatio ad the best average. Table 2. Results for ucorrelated istace same result i ay iteractio, there is o exist std. deviatio The Figure 1 depicts the performace for each algorithm i each iteractio. 81
5 Beefit Iteratioal Joural of Vol.4,No.5, 214 Published olie: May 25, 214 DOI: /jscse.v Performace o Ucorrelated istace Beefit Greed algorithm Geetic algorithm algorithm Figure 1. Trials for ucorrelated istace Weakly correlated: the Table 3 details the results for all algorithms where the agai offers the best std. deviatio ad the best average. Table 3. Results for weakly correlated istace same result i ay iteractio, there is o exist std. deviatio The Figure 2 details the performace for each algorithm i each iteractio Performace o Weakly correlated istace Greed algorithm Geetic algorithm algorithm Figure 2. Trials for weakly correlated istace Strogly correlated: the Table 4 shows the results for all algorithms where the agai offers the best std. deviatio ad the best average. Table 4. Results for strogly correlated istace 82
6 Beefit Iteratioal Joural of Vol.4,No.5, 214 Published olie: May 25, same result i ay iteractio, there is o exist std. deviatio DOI: /jscse.v The Figure 3 shows the performace for each algorithm i each iteractio. 12 Performace o Strogly correlated istace 1 8 Beefit Greed algorithm Geetic algorithm algorithm Figure 3. Trials for strogly correlated istace Subsetsum: the Table 5 presets the results for all algorithms where the agai offers the best std. deviatio ad the best average. Table 5. Results for subsetsum istace same result i ay iteractio, there is o exist std. deviatio The Figure 4 presets the performace for each algorithm i each iteractio. 12 Performace o Subsetsum istace Greed algorithm Geetic algorithm algorithm Figure 4. Trials for subsetsum istace 83
7 Vol.4,No.5, 214 Published olie: May 25, 214 DOI: /jscse.v Coclusios There are may evolutioary algorithms ad metaheuristics to solve the Kapsack problem; i this work we itroduce the algorithm which is a evolutioary algorithm. The experimets were desiged with the same parameters for the three algorithms to give them the same characteristics i order to be equal betwee them. We ca see i all the graphics the algorithms behavior, ad we ca observe that the Greedy Algorithm was the worst because it always yields the same result for ay iteractio. The ad the yield more cosistet results, its graphs show that these algorithms i the most of the cases give good results. So we ca coclude that the is a alterative to solve the Kapsack problem, because each time that it's ru, it gives a good solutio, ad this solutio always is better that the solutios obtaied by the other algorithms. Overall the results preset a low stadard deviatio. Refereces [1] McDuffSpears W, Usig eural etworks ad geetic algorithms as heuristics for NPcomplete problems, Thesis of Master of Sciece i Computer Sciece, George Maso Uiversity, Virgiia, USA, [2] Mühlebei H, Paaß G, From recombiatio of gees to the estimatio of distributios: I. biary parameters, i Parallel Problem Solvig from Nature PPSN IV, Voigt H, Ebelig W, Recheberg I, Schwefel H, Eds., Berli: Spriger, pp , [3] Che S, Che M, Chag P, Zhag Q, Che Y, Guidelies for developig effective Estimatio of Distributio Algorithms i solvig sigle machie schedulig problems, Expert Systems with Applicatios, vol. 37, pp , 21. [4] Liu H, Gao L, Pa Q, A hybrid particle swarm optimizatio with estimatio of distributio algorithm for solvig permutatio flowshop schedulig problem, Experts Systems with Applicatios, vol. 38, pp , 211. [5] Pa Q, Ruiz R, A estimatio of distributio algorithm for lotstreamig flow shop problems with setup times, Omega, vol. 4, pp , 212. [6] Che S, Chag P, Cheg T, Zhag Q, A Selfguided for permutatio flowshop schedulig problems, Computers ad Operatios Research, vol. 39, pp , 212. [7] Wag L, Wag S, Xu Y, Zhou G, Liu M, A bipopulatio based estimatio of distributio algorithm for the flexible jobshop schedulig problem, Computers ad Idustrial Egieerig, vol. 62, pp , 212. [8] Che Y, Che M, Chag P, Che S, Exteded artificial chromosomes geetic algorithm for permutatio flowshop schedulig problems, Computers ad Idustrial Egieerig, vol. 62, pp , 212. [9] Kellerer H, Pferschy U, Pisiger D, Kapsack Problems, Spriger, Berli, Germay, 24. [1] Silvao M, Toth P, Kapsack Problem, Algorithms, ad Computer Implemetatios, Joh Wiley ad Sos, New York, USA, 199. [11] Garey M, David S, Computers ad Itractibility: A Guide to the Theory of NPCompleteess I, [12] Pisiger D, Where Are The Hard Kapsack problems?, Computers ad Operatios Research, vol. 32, pp , 25. [13] De Boet J, Isbell C, Viola P, MIMIC: Fidig Optima by Estimatio Probability Desities, Advaces i Neural Iformatio Processig Systems, vol. 9, [14] Pisiger D, Core Problems i Kapsack Algorithms, Operatios Research, vol. 32, pp ,
Ones Assignment Method for Solving Traveling Salesman Problem
Joural of mathematics ad computer sciece 0 (0), 58-65 Oes Assigmet Method for Solvig Travelig Salesma Problem Hadi Basirzadeh Departmet of Mathematics, Shahid Chamra Uiversity, Ahvaz, Ira Article history:
More informationAn Improved Shuffled Frog-Leaping Algorithm for Knapsack Problem
A Improved Shuffled Frog-Leapig Algorithm for Kapsack Problem Zhoufag Li, Ya Zhou, ad Peg Cheg School of Iformatio Sciece ad Egieerig Hea Uiversity of Techology ZhegZhou, Chia lzhf1978@126.com Abstract.
More informationISSN (Print) Research Article. *Corresponding author Nengfa Hu
Scholars Joural of Egieerig ad Techology (SJET) Sch. J. Eg. Tech., 2016; 4(5):249-253 Scholars Academic ad Scietific Publisher (A Iteratioal Publisher for Academic ad Scietific Resources) www.saspublisher.com
More informationEuclidean Distance Based Feature Selection for Fault Detection Prediction Model in Semiconductor Manufacturing Process
Vol.133 (Iformatio Techology ad Computer Sciece 016), pp.85-89 http://dx.doi.org/10.1457/astl.016. Euclidea Distace Based Feature Selectio for Fault Detectio Predictio Model i Semicoductor Maufacturig
More informationA New Morphological 3D Shape Decomposition: Grayscale Interframe Interpolation Method
A ew Morphological 3D Shape Decompositio: Grayscale Iterframe Iterpolatio Method D.. Vizireau Politehica Uiversity Bucharest, Romaia ae@comm.pub.ro R. M. Udrea Politehica Uiversity Bucharest, Romaia mihea@comm.pub.ro
More informationOptimization for framework design of new product introduction management system Ma Ying, Wu Hongcui
2d Iteratioal Coferece o Electrical, Computer Egieerig ad Electroics (ICECEE 2015) Optimizatio for framework desig of ew product itroductio maagemet system Ma Yig, Wu Hogcui Tiaji Electroic Iformatio Vocatioal
More informationHeuristic Approaches for Solving the Multidimensional Knapsack Problem (MKP)
Heuristic Approaches for Solvig the Multidimesioal Kapsack Problem (MKP) R. PARRA-HERNANDEZ N. DIMOPOULOS Departmet of Electrical ad Computer Eg. Uiversity of Victoria Victoria, B.C. CANADA Abstract: -
More informationIntroduction. Nature-Inspired Computing. Terminology. Problem Types. Constraint Satisfaction Problems - CSP. Free Optimization Problem - FOP
Nature-Ispired Computig Hadlig Costraits Dr. Şima Uyar September 2006 Itroductio may practical problems are costraied ot all combiatios of variable values represet valid solutios feasible solutios ifeasible
More information3D Model Retrieval Method Based on Sample Prediction
20 Iteratioal Coferece o Computer Commuicatio ad Maagemet Proc.of CSIT vol.5 (20) (20) IACSIT Press, Sigapore 3D Model Retrieval Method Based o Sample Predictio Qigche Zhag, Ya Tag* School of Computer
More informationSolving Fuzzy Assignment Problem Using Fourier Elimination Method
Global Joural of Pure ad Applied Mathematics. ISSN 0973-768 Volume 3, Number 2 (207), pp. 453-462 Research Idia Publicatios http://www.ripublicatio.com Solvig Fuzzy Assigmet Problem Usig Fourier Elimiatio
More informationBASED ON ITERATIVE ERROR-CORRECTION
A COHPARISO OF CRYPTAALYTIC PRICIPLES BASED O ITERATIVE ERROR-CORRECTIO Miodrag J. MihaljeviC ad Jova Dj. GoliC Istitute of Applied Mathematics ad Electroics. Belgrade School of Electrical Egieerig. Uiversity
More informationCopyright 2016 Ramez Elmasri and Shamkant B. Navathe
Copyright 2016 Ramez Elmasri ad Shamkat B. Navathe CHAPTER 19 Query Optimizatio Copyright 2016 Ramez Elmasri ad Shamkat B. Navathe Itroductio Query optimizatio Coducted by a query optimizer i a DBMS Goal:
More informationImproving Template Based Spike Detection
Improvig Template Based Spike Detectio Kirk Smith, Member - IEEE Portlad State Uiversity petra@ee.pdx.edu Abstract Template matchig algorithms like SSE, Covolutio ad Maximum Likelihood are well kow for
More information6.854J / J Advanced Algorithms Fall 2008
MIT OpeCourseWare http://ocw.mit.edu 6.854J / 18.415J Advaced Algorithms Fall 2008 For iformatio about citig these materials or our Terms of Use, visit: http://ocw.mit.edu/terms. 18.415/6.854 Advaced Algorithms
More informationn n B. How many subsets of C are there of cardinality n. We are selecting elements for such a
4. [10] Usig a combiatorial argumet, prove that for 1: = 0 = Let A ad B be disjoit sets of cardiality each ad C = A B. How may subsets of C are there of cardiality. We are selectig elemets for such a subset
More informationMałgorzata Sterna. Mateusz Cicheński, Mateusz Jarus, Michał Miszkiewicz, Jarosław Szymczak
Małgorzata Stera Mateusz Cicheński, Mateusz Jarus, Michał Miszkiewicz, Jarosław Szymczak Istitute of Computig Sciece Pozań Uiversity of Techology Pozań - Polad Scope of the Talk Problem defiitio MP Formulatio
More informationTask scenarios Outline. Scenarios in Knowledge Extraction. Proposed Framework for Scenario to Design Diagram Transformation
6-0-0 Kowledge Trasformatio from Task Scearios to View-based Desig Diagrams Nima Dezhkam Kamra Sartipi {dezhka, sartipi}@mcmaster.ca Departmet of Computig ad Software McMaster Uiversity CANADA SEKE 08
More informationA Note on Least-norm Solution of Global WireWarping
A Note o Least-orm Solutio of Global WireWarpig Charlie C. L. Wag Departmet of Mechaical ad Automatio Egieerig The Chiese Uiversity of Hog Kog Shati, N.T., Hog Kog E-mail: cwag@mae.cuhk.edu.hk Abstract
More informationMobile terminal 3D image reconstruction program development based on Android Lin Qinhua
Iteratioal Coferece o Automatio, Mechaical Cotrol ad Computatioal Egieerig (AMCCE 05) Mobile termial 3D image recostructio program developmet based o Adroid Li Qihua Sichua Iformatio Techology College
More informationRedundancy Allocation for Series Parallel Systems with Multiple Constraints and Sensitivity Analysis
IOSR Joural of Egieerig Redudacy Allocatio for Series Parallel Systems with Multiple Costraits ad Sesitivity Aalysis S. V. Suresh Babu, D.Maheswar 2, G. Ragaath 3 Y.Viaya Kumar d G.Sakaraiah e (Mechaical
More informationAdaptive Resource Allocation for Electric Environmental Pollution through the Control Network
Available olie at www.sciecedirect.com Eergy Procedia 6 (202) 60 64 202 Iteratioal Coferece o Future Eergy, Eviromet, ad Materials Adaptive Resource Allocatio for Electric Evirometal Pollutio through the
More informationAn Efficient Algorithm for Graph Bisection of Triangularizations
A Efficiet Algorithm for Graph Bisectio of Triagularizatios Gerold Jäger Departmet of Computer Sciece Washigto Uiversity Campus Box 1045 Oe Brookigs Drive St. Louis, Missouri 63130-4899, USA jaegerg@cse.wustl.edu
More information. Written in factored form it is easy to see that the roots are 2, 2, i,
CMPS A Itroductio to Programmig Programmig Assigmet 4 I this assigmet you will write a java program that determies the real roots of a polyomial that lie withi a specified rage. Recall that the roots (or
More informationMulti Attributes Approach for Tourist Trips Design
Multi Attributes Approach for Tourist Trips Desig Ilaria Baffo 1, Pasquale Caroteuto 2, Atoella Petrillo 3, Fabio De Felice 4 1 Idustrial Egieerig School (DEIM) - Uiversity of Tuscia, Italy ilaria.baffo@uitus.it
More informationFuzzy Rule Selection by Data Mining Criteria and Genetic Algorithms
Fuzzy Rule Selectio by Data Miig Criteria ad Geetic Algorithms Hisao Ishibuchi Dept. of Idustrial Egieerig Osaka Prefecture Uiversity 1-1 Gakue-cho, Sakai, Osaka 599-8531, JAPAN E-mail: hisaoi@ie.osakafu-u.ac.jp
More informationExact Minimum Lower Bound Algorithm for Traveling Salesman Problem
Exact Miimum Lower Boud Algorithm for Travelig Salesma Problem Mohamed Eleiche GeoTiba Systems mohamed.eleiche@gmail.com Abstract The miimum-travel-cost algorithm is a dyamic programmig algorithm to compute
More informationLecture Notes 6 Introduction to algorithm analysis CSS 501 Data Structures and Object-Oriented Programming
Lecture Notes 6 Itroductio to algorithm aalysis CSS 501 Data Structures ad Object-Orieted Programmig Readig for this lecture: Carrao, Chapter 10 To be covered i this lecture: Itroductio to algorithm aalysis
More informationA SOFTWARE MODEL FOR THE MULTILAYER PERCEPTRON
A SOFTWARE MODEL FOR THE MULTILAYER PERCEPTRON Roberto Lopez ad Eugeio Oñate Iteratioal Ceter for Numerical Methods i Egieerig (CIMNE) Edificio C1, Gra Capitá s/, 08034 Barceloa, Spai ABSTRACT I this work
More informationSorting in Linear Time. Data Structures and Algorithms Andrei Bulatov
Sortig i Liear Time Data Structures ad Algorithms Adrei Bulatov Algorithms Sortig i Liear Time 7-2 Compariso Sorts The oly test that all the algorithms we have cosidered so far is compariso The oly iformatio
More informationMemetic Algorithm: Hybridization of Hill Climbing with Selection Operator
Iteratioal Joural of Soft Computig ad Egieerig (IJSCE) ISSN: 2231-2307, Volume-3, Issue-2, May 2013 Memetic Algorithm: Hybridizatio of Hill Climbig with Selectio Operator Rakesh Kumar, Sajay Tyagi, Maju
More informationLecture 6. Lecturer: Ronitt Rubinfeld Scribes: Chen Ziv, Eliav Buchnik, Ophir Arie, Jonathan Gradstein
068.670 Subliear Time Algorithms November, 0 Lecture 6 Lecturer: Roitt Rubifeld Scribes: Che Ziv, Eliav Buchik, Ophir Arie, Joatha Gradstei Lesso overview. Usig the oracle reductio framework for approximatig
More informationFeature classification for multi-focus image fusion
Iteratioal Joural of the Physical Scieces Vol. 6(0), pp. 4838-4847, 3 September, 0 Available olie at http://www.academicjourals.org/ijps DOI: 0.5897/IJPS.73 ISSN 99-950 0 Academic Jourals Full Legth Research
More informationAnalysis of Server Resource Consumption of Meteorological Satellite Application System Based on Contour Curve
Advaces i Computer, Sigals ad Systems (2018) 2: 19-25 Clausius Scietific Press, Caada Aalysis of Server Resource Cosumptio of Meteorological Satellite Applicatio System Based o Cotour Curve Xiagag Zhao
More informationLoad balanced Parallel Prime Number Generator with Sieve of Eratosthenes on Cluster Computers *
Load balaced Parallel Prime umber Geerator with Sieve of Eratosthees o luster omputers * Soowook Hwag*, Kyusik hug**, ad Dogseug Kim* *Departmet of Electrical Egieerig Korea Uiversity Seoul, -, Rep. of
More informationRelationship between augmented eccentric connectivity index and some other graph invariants
Iteratioal Joural of Advaced Mathematical Scieces, () (03) 6-3 Sciece Publishig Corporatio wwwsciecepubcocom/idexphp/ijams Relatioship betwee augmeted eccetric coectivity idex ad some other graph ivariats
More informationCS 683: Advanced Design and Analysis of Algorithms
CS 683: Advaced Desig ad Aalysis of Algorithms Lecture 6, February 1, 2008 Lecturer: Joh Hopcroft Scribes: Shaomei Wu, Etha Feldma February 7, 2008 1 Threshold for k CNF Satisfiability I the previous lecture,
More informationAnalysis Metrics. Intro to Algorithm Analysis. Slides. 12. Alg Analysis. 12. Alg Analysis
Itro to Algorithm Aalysis Aalysis Metrics Slides. Table of Cotets. Aalysis Metrics 3. Exact Aalysis Rules 4. Simple Summatio 5. Summatio Formulas 6. Order of Magitude 7. Big-O otatio 8. Big-O Theorems
More informationImprovement of the Orthogonal Code Convolution Capabilities Using FPGA Implementation
Improvemet of the Orthogoal Code Covolutio Capabilities Usig FPGA Implemetatio Naima Kaabouch, Member, IEEE, Apara Dhirde, Member, IEEE, Saleh Faruque, Member, IEEE Departmet of Electrical Egieerig, Uiversity
More informationLecture 5. Counting Sort / Radix Sort
Lecture 5. Coutig Sort / Radix Sort T. H. Corme, C. E. Leiserso ad R. L. Rivest Itroductio to Algorithms, 3rd Editio, MIT Press, 2009 Sugkyukwa Uiversity Hyuseug Choo choo@skku.edu Copyright 2000-2018
More informationA Novel Approach to Solve Multiple Traveling Salesmen Problem by Genetic Algorithm
A Novel Approach to Solve Multiple Travelig Salesme Problem by Geetic Algorithm Adrás Király, Jáos Aboyi Uiversity of Paoia, Departmet of Process Egieerig, P.O. Box 58. Veszprém H-8200, HUNGARY, e-mail:
More informationCounting the Number of Minimum Roman Dominating Functions of a Graph
Coutig the Number of Miimum Roma Domiatig Fuctios of a Graph SHI ZHENG ad KOH KHEE MENG, Natioal Uiversity of Sigapore We provide two algorithms coutig the umber of miimum Roma domiatig fuctios of a graph
More informationA Generalized Set Theoretic Approach for Time and Space Complexity Analysis of Algorithms and Functions
Proceedigs of the 10th WSEAS Iteratioal Coferece o APPLIED MATHEMATICS, Dallas, Texas, USA, November 1-3, 2006 316 A Geeralized Set Theoretic Approach for Time ad Space Complexity Aalysis of Algorithms
More informationAutomatic Test Data Generation using Genetic Algorithm using Sequence Diagram
Iteratioal Joural of Computer Systems (ISSN: 2394-1065), Volume 03 Issue 02, February, 2016 Available at http://www.ijcsolie.com/ Automatic Test Data Geeratio usig Geetic Algorithm usig Sequece Diagram
More informationAlgorithms for Disk Covering Problems with the Most Points
Algorithms for Disk Coverig Problems with the Most Poits Bi Xiao Departmet of Computig Hog Kog Polytechic Uiversity Hug Hom, Kowloo, Hog Kog csbxiao@comp.polyu.edu.hk Qigfeg Zhuge, Yi He, Zili Shao, Edwi
More informationBOOLEAN MATHEMATICS: GENERAL THEORY
CHAPTER 3 BOOLEAN MATHEMATICS: GENERAL THEORY 3.1 ISOMORPHIC PROPERTIES The ame Boolea Arithmetic was chose because it was discovered that literal Boolea Algebra could have a isomorphic umerical aspect.
More informationAssignment Problems with fuzzy costs using Ones Assignment Method
IOSR Joural of Mathematics (IOSR-JM) e-issn: 8-8, p-issn: 9-6. Volume, Issue Ver. V (Sep. - Oct.06), PP 8-89 www.iosrjourals.org Assigmet Problems with fuzzy costs usig Oes Assigmet Method S.Vimala, S.Krisha
More informationCIS 121 Data Structures and Algorithms with Java Fall Big-Oh Notation Tuesday, September 5 (Make-up Friday, September 8)
CIS 11 Data Structures ad Algorithms with Java Fall 017 Big-Oh Notatio Tuesday, September 5 (Make-up Friday, September 8) Learig Goals Review Big-Oh ad lear big/small omega/theta otatios Practice solvig
More informationOptimization of Multiple Input Single Output Fuzzy Membership Functions Using Clonal Selection Algorithm
Optimizatio of Multiple Iput Sigle Output Fuzzy Membership Fuctios Usig Cloal Selectio Algorithm AYŞE MERVE ACILAR, AHMET ARSLAN Computer Egieerig Departmet Selcuk Uiversity Selcuk Uiversity, Eg.-Arch.
More informationAn Efficient Algorithm for Graph Bisection of Triangularizations
Applied Mathematical Scieces, Vol. 1, 2007, o. 25, 1203-1215 A Efficiet Algorithm for Graph Bisectio of Triagularizatios Gerold Jäger Departmet of Computer Sciece Washigto Uiversity Campus Box 1045, Oe
More informationAutomatic Generation of Polynomial-Basis Multipliers in GF (2 n ) using Recursive VHDL
Automatic Geeratio of Polyomial-Basis Multipliers i GF (2 ) usig Recursive VHDL J. Nelso, G. Lai, A. Teca Abstract Multiplicatio i GF (2 ) is very commoly used i the fields of cryptography ad error correctig
More informationHow do we evaluate algorithms?
F2 Readig referece: chapter 2 + slides Algorithm complexity Big O ad big Ω To calculate ruig time Aalysis of recursive Algorithms Next time: Litterature: slides mostly The first Algorithm desig methods:
More informationBAYESIAN WITH FULL CONDITIONAL POSTERIOR DISTRIBUTION APPROACH FOR SOLUTION OF COMPLEX MODELS. Pudji Ismartini
Proceedig of Iteratioal Coferece O Research, Implemetatio Ad Educatio Of Mathematics Ad Scieces 014, Yogyakarta State Uiversity, 18-0 May 014 BAYESIAN WIH FULL CONDIIONAL POSERIOR DISRIBUION APPROACH FOR
More informationLecture 13: Validation
Lecture 3: Validatio Resampli methods Holdout Cross Validatio Radom Subsampli -Fold Cross-Validatio Leave-oe-out The Bootstrap Bias ad variace estimatio Three-way data partitioi Itroductio to Patter Recoitio
More informationChapter 3 Classification of FFT Processor Algorithms
Chapter Classificatio of FFT Processor Algorithms The computatioal complexity of the Discrete Fourier trasform (DFT) is very high. It requires () 2 complex multiplicatios ad () complex additios [5]. As
More informationEvaluation of Different Fitness Functions for the Evolutionary Testing of an Autonomous Parking System
Evaluatio of Differet Fitess Fuctios for the Evolutioary Testig of a Autoomous Parkig System Joachim Wegeer 1 ad Oliver Bühler 2 1 DaimlerChrysler AG, Research ad Techology, Alt-Moabit 96 a, D-10559 Berli,
More informationStudy on effective detection method for specific data of large database LI Jin-feng
Iteratioal Coferece o Automatio, Mechaical Cotrol ad Computatioal Egieerig (AMCCE 205) Study o effective detectio method for specific data of large database LI Ji-feg (Vocatioal College of DogYig, Shadog
More informationAPPLICATION NOTE PACE1750AE BUILT-IN FUNCTIONS
APPLICATION NOTE PACE175AE BUILT-IN UNCTIONS About This Note This applicatio brief is iteded to explai ad demostrate the use of the special fuctios that are built ito the PACE175AE processor. These powerful
More informationUniversity of Waterloo Department of Electrical and Computer Engineering ECE 250 Algorithms and Data Structures
Uiversity of Waterloo Departmet of Electrical ad Computer Egieerig ECE 250 Algorithms ad Data Structures Midterm Examiatio ( pages) Istructor: Douglas Harder February 7, 2004 7:30-9:00 Name (last, first)
More informationImage Segmentation EEE 508
Image Segmetatio Objective: to determie (etract) object boudaries. It is a process of partitioig a image ito distict regios by groupig together eighborig piels based o some predefied similarity criterio.
More informationLecture 1: Introduction and Strassen s Algorithm
5-750: Graduate Algorithms Jauary 7, 08 Lecture : Itroductio ad Strasse s Algorithm Lecturer: Gary Miller Scribe: Robert Parker Itroductio Machie models I this class, we will primarily use the Radom Access
More informationBOOLEAN DIFFERENTIATION EQUATIONS APPLICABLE IN RECONFIGURABLE COMPUTATIONAL MEDIUM
MATEC Web of Cofereces 79, 01014 (016) DOI: 10.1051/ mateccof/0167901014 T 016 BOOLEAN DIFFERENTIATION EQUATIONS APPLICABLE IN RECONFIGURABLE COMPUTATIONAL MEDIUM Staislav Shidlovskiy 1, 1 Natioal Research
More informationBayesian approach to reliability modelling for a probability of failure on demand parameter
Bayesia approach to reliability modellig for a probability of failure o demad parameter BÖRCSÖK J., SCHAEFER S. Departmet of Computer Architecture ad System Programmig Uiversity Kassel, Wilhelmshöher Allee
More informationMath Section 2.2 Polynomial Functions
Math 1330 - Sectio. Polyomial Fuctios Our objectives i workig with polyomial fuctios will be, first, to gather iformatio about the graph of the fuctio ad, secod, to use that iformatio to geerate a reasoably
More informationFuzzy Minimal Solution of Dual Fully Fuzzy Matrix Equations
Iteratioal Coferece o Applied Mathematics, Simulatio ad Modellig (AMSM 2016) Fuzzy Miimal Solutio of Dual Fully Fuzzy Matrix Equatios Dequa Shag1 ad Xiaobi Guo2,* 1 Sciece Courses eachig Departmet, Gasu
More informationNeural Networks A Model of Boolean Functions
Neural Networks A Model of Boolea Fuctios Berd Steibach, Roma Kohut Freiberg Uiversity of Miig ad Techology Istitute of Computer Sciece D-09596 Freiberg, Germay e-mails: steib@iformatik.tu-freiberg.de
More informationEvaluation scheme for Tracking in AMI
A M I C o m m u i c a t i o A U G M E N T E D M U L T I - P A R T Y I N T E R A C T I O N http://www.amiproject.org/ Evaluatio scheme for Trackig i AMI S. Schreiber a D. Gatica-Perez b AMI WP4 Trackig:
More informationRelay Placement Based on Divide-and-Conquer
Relay Placemet Based o Divide-ad-Coquer Ravabakhsh Akhlaghiia, Azadeh Kaviafar, ad Mohamad Javad Rostami, Member, IACSIT Abstract I this paper, we defie a relay placemet problem to cover a large umber
More informationResearch Article A New Formulation of the Set Covering Problem for Metaheuristic Approaches
ISRN Operatios Research Volume 2013, Article ID 203032, 10 pages http://dx.doi.org/10.1155/2013/203032 Research Article A New Formulatio of the Set Coverig Problem for Metaheuristic Approaches Nehme Bilal,
More informationLecturers: Sanjam Garg and Prasad Raghavendra Feb 21, Midterm 1 Solutions
U.C. Berkeley CS170 : Algorithms Midterm 1 Solutios Lecturers: Sajam Garg ad Prasad Raghavedra Feb 1, 017 Midterm 1 Solutios 1. (4 poits) For the directed graph below, fid all the strogly coected compoets
More informationHash Tables. Presentation for use with the textbook Algorithm Design and Applications, by M. T. Goodrich and R. Tamassia, Wiley, 2015.
Presetatio for use with the textbook Algorithm Desig ad Applicatios, by M. T. Goodrich ad R. Tamassia, Wiley, 2015 Hash Tables xkcd. http://xkcd.com/221/. Radom Number. Used with permissio uder Creative
More informationChapter 11. Friends, Overloaded Operators, and Arrays in Classes. Copyright 2014 Pearson Addison-Wesley. All rights reserved.
Chapter 11 Frieds, Overloaded Operators, ad Arrays i Classes Copyright 2014 Pearso Addiso-Wesley. All rights reserved. Overview 11.1 Fried Fuctios 11.2 Overloadig Operators 11.3 Arrays ad Classes 11.4
More informationA Novel Hybrid Algorithm for Software Cost Estimation Based on Cuckoo Optimization and K-Nearest Neighbors Algorithms
Egieerig, Techology & Applied Sciece Research Vol. 6, No. 3, 26, 8-22 8 A Novel Hybrid Algorithm for Software Cost Estimatio Based o Optimizatio ad K-Nearest Neighbors Algorithms Elaz Eskadaria Miadoab
More informationEE 459/500 HDL Based Digital Design with Programmable Logic. Lecture 13 Control and Sequencing: Hardwired and Microprogrammed Control
EE 459/500 HDL Based Digital Desig with Programmable Logic Lecture 13 Cotrol ad Sequecig: Hardwired ad Microprogrammed Cotrol Refereces: Chapter s 4,5 from textbook Chapter 7 of M.M. Mao ad C.R. Kime,
More informationCIS 121 Data Structures and Algorithms with Java Spring Stacks and Queues Monday, February 12 / Tuesday, February 13
CIS Data Structures ad Algorithms with Java Sprig 08 Stacks ad Queues Moday, February / Tuesday, February Learig Goals Durig this lab, you will: Review stacks ad queues. Lear amortized ruig time aalysis
More informationSOFTWARE usually does not work alone. It must have
Proceedigs of the 203 Federated Coferece o Computer Sciece ad Iformatio Systems pp. 343 348 A method for selectig eviromets for software compatibility testig Łukasz Pobereżik AGH Uiversity of Sciece ad
More informationOctahedral Graph Scaling
Octahedral Graph Scalig Peter Russell Jauary 1, 2015 Abstract There is presetly o strog iterpretatio for the otio of -vertex graph scalig. This paper presets a ew defiitio for the term i the cotext of
More informationHole Machining Path Planning Optimization Based on Dynamic Tabu Artificial Bee Colony Algorithm
Research Joural of Applied Scieces, Egieerig ad Techology 5(4): 1454-1460, 2013 ISSN: 2040-7459; e-issn: 2040-7467 Maxwell Scietific Orgaizatio, 2013 Submitted: August 17, 2012 Accepted: September 17,
More information1 Graph Sparsfication
CME 305: Discrete Mathematics ad Algorithms 1 Graph Sparsficatio I this sectio we discuss the approximatio of a graph G(V, E) by a sparse graph H(V, F ) o the same vertex set. I particular, we cosider
More informationPython Programming: An Introduction to Computer Science
Pytho Programmig: A Itroductio to Computer Sciece Chapter 1 Computers ad Programs 1 Objectives To uderstad the respective roles of hardware ad software i a computig system. To lear what computer scietists
More informationAnalysis of Documents Clustering Using Sampled Agglomerative Technique
Aalysis of Documets Clusterig Usig Sampled Agglomerative Techique Omar H. Karam, Ahmed M. Hamad, ad Sheri M. Moussa Abstract I this paper a clusterig algorithm for documets is proposed that adapts a samplig-based
More informationThe isoperimetric problem on the hypercube
The isoperimetric problem o the hypercube Prepared by: Steve Butler November 2, 2005 1 The isoperimetric problem We will cosider the -dimesioal hypercube Q Recall that the hypercube Q is a graph whose
More informationJob Scheduling for Hybrid Assembly Differentiation Flowshop to Minimize Total Actual Flow Time
Job Schedulig for Hybrid Assembly Differetiatio Flowshop to Miimize Total Actual Flow Time Rahmi Maulidya, Rachmawati Wagsaputra, Suprayogi, Abdul Hakim Halim Faculty of Idustrial Techology Istitut Tekologi
More informationNew Results on Energy of Graphs of Small Order
Global Joural of Pure ad Applied Mathematics. ISSN 0973-1768 Volume 13, Number 7 (2017), pp. 2837-2848 Research Idia Publicatios http://www.ripublicatio.com New Results o Eergy of Graphs of Small Order
More informationContinuous Ant Colony System and Tabu Search Algorithms Hybridized for Global Minimization of Continuous Multi-minima Functions
Cotiuous At Coloy System ad Tabu Search Algorithms Hybridized for Global Miimizatio of Cotiuous Multi-miima Fuctios Akbar Karimi Departmet of Aerospace Egieerig, Sharif Uiversity of Techology, P.O. Box:
More informationCIS 121 Data Structures and Algorithms with Java Spring Stacks, Queues, and Heaps Monday, February 18 / Tuesday, February 19
CIS Data Structures ad Algorithms with Java Sprig 09 Stacks, Queues, ad Heaps Moday, February 8 / Tuesday, February 9 Stacks ad Queues Recall the stack ad queue ADTs (abstract data types from lecture.
More informationA Parallel DFA Minimization Algorithm
A Parallel DFA Miimizatio Algorithm Ambuj Tewari, Utkarsh Srivastava, ad P. Gupta Departmet of Computer Sciece & Egieerig Idia Istitute of Techology Kapur Kapur 208 016,INDIA pg@iitk.ac.i Abstract. I this
More informationPruning and Summarizing the Discovered Time Series Association Rules from Mechanical Sensor Data Qing YANG1,a,*, Shao-Yu WANG1,b, Ting-Ting ZHANG2,c
Advaces i Egieerig Research (AER), volume 131 3rd Aual Iteratioal Coferece o Electroics, Electrical Egieerig ad Iformatio Sciece (EEEIS 2017) Pruig ad Summarizig the Discovered Time Series Associatio Rules
More informationOPTIMAL SEQUENCE OF HOLE-MAKING OPERATIONS USING PARTICLE SWARM OPTIMISATION AND SHUFFLED FROG LEAPING ALGORITHM
Egieerig Review, Vol. 36, Issue, 187-196, 016. 187 OPTIMAL SEQUENCE OF HOLE-MAKING OPERATIONS USING PARTICLE SWARM OPTIMISATION AND SHUFFLED FROG LEAPING ALGORITHM Amol M. Dalavi 1* - Padmakar J. Pawar
More informationDigital Microfluidic Biochips Online Fault Detection Route Optimization Scheme Chuan-pei XU and Tong-zhou ZHAO *
2018 Iteratioal Coferece o Commuicatio, Network ad Artificial Itelligece (CNAI 2018) ISBN: 978-1-60595-065-5 Digital Microfluidic Biochips Olie Fault Detectio Route Optimizatio Scheme Chua-pei XU ad Tog-zhou
More informationHomework 1 Solutions MA 522 Fall 2017
Homework 1 Solutios MA 5 Fall 017 1. Cosider the searchig problem: Iput A sequece of umbers A = [a 1,..., a ] ad a value v. Output A idex i such that v = A[i] or the special value NIL if v does ot appear
More informationCubic Polynomial Curves with a Shape Parameter
roceedigs of the th WSEAS Iteratioal Coferece o Robotics Cotrol ad Maufacturig Techology Hagzhou Chia April -8 00 (pp5-70) Cubic olyomial Curves with a Shape arameter MO GUOLIANG ZHAO YANAN Iformatio ad
More informationLecture 17: Feature Subset Selection II
Lecture 17: Feature Subset Selectio II Expoetial search methods Brach ad Boud Approximate Mootoicity with Brach ad Boud Beam Search Radomized alorithms Radom Geeratio plus Sequetial Selectio Simulated
More informationLower Bounds for Sorting
Liear Sortig Topics Covered: Lower Bouds for Sortig Coutig Sort Radix Sort Bucket Sort Lower Bouds for Sortig Compariso vs. o-compariso sortig Decisio tree model Worst case lower boud Compariso Sortig
More informationChapter 8. Strings and Vectors. Copyright 2014 Pearson Addison-Wesley. All rights reserved.
Chapter 8 Strigs ad Vectors Overview 8.1 A Array Type for Strigs 8.2 The Stadard strig Class 8.3 Vectors Slide 8-3 8.1 A Array Type for Strigs A Array Type for Strigs C-strigs ca be used to represet strigs
More informationIMP: Superposer Integrated Morphometrics Package Superposition Tool
IMP: Superposer Itegrated Morphometrics Package Superpositio Tool Programmig by: David Lieber ( 03) Caisius College 200 Mai St. Buffalo, NY 4208 Cocept by: H. David Sheets, Dept. of Physics, Caisius College
More informationData diverse software fault tolerance techniques
Data diverse software fault tolerace techiques Complemets desig diversity by compesatig for desig diversity s s limitatios Ivolves obtaiig a related set of poits i the program data space, executig the
More informationAdministrative UNSUPERVISED LEARNING. Unsupervised learning. Supervised learning 11/25/13. Final project. No office hours today
Admiistrative Fial project No office hours today UNSUPERVISED LEARNING David Kauchak CS 451 Fall 2013 Supervised learig Usupervised learig label label 1 label 3 model/ predictor label 4 label 5 Supervised
More informationProbabilistic Fuzzy Time Series Method Based on Artificial Neural Network
America Joural of Itelliget Systems 206, 6(2): 42-47 DOI: 0.5923/j.ajis.2060602.02 Probabilistic Fuzzy Time Series Method Based o Artificial Neural Network Erol Egrioglu,*, Ere Bas, Cagdas Haka Aladag
More informationParallel Learning of Large Fuzzy Cognitive Maps
g Proceedigs of Iteratioal Joit Coferece o Neural Networks, Orlado, Florida, USA, August 2-7, 07 Parallel Learig of Large Fuzzy Cogitive Maps Wojciech Stach, Lukasz Kurga, ad Witold Pedrycz Abstract Fuzzy
More informationTHIN LAYER ORIENTED MAGNETOSTATIC CALCULATION MODULE FOR ELMER FEM, BASED ON THE METHOD OF THE MOMENTS. Roman Szewczyk
THIN LAYER ORIENTED MAGNETOSTATIC CALCULATION MODULE FOR ELMER FEM, BASED ON THE METHOD OF THE MOMENTS Roma Szewczyk Istitute of Metrology ad Biomedical Egieerig, Warsaw Uiversity of Techology E-mail:
More information