Sign inSubmit
Tips: “quotes” for a phrase · author:Lee · a DOI goes straight to its article

9 results for “Knapsack problem”
Set a search alert
Research ArticleOpen accessPhrase in the titleAn Improved Genetic Algorithm Based on Adaptive Repair Operator for Solving the Knapsack ProblemSunanda Gupta, M. L. GargProblem statement: Knapsack problem is a typical NP complete problem. During last few decades, Knapsack problem has been studied through different approaches, according to the theoretical development of combinatorial optimization. Approach: In this study, modified evolutionary algorithm was presented for 0/1 knapsack problem. Results: A new objective_func_evaluation operator was proposed which employed adaptive repair function named as repair and elitism … …Journal of Computer Science, Vol. 5, Issue 8 · 31 Aug 2009 · 7,713 accessesView PDFCite
Research ArticleOpen accessPhrase in the titleA Stochastic Knapsack Problem with Continuous Random CapacitySuwitchporn Witchakul, Prapaisri Sudas Na Ayudhaya, Peerayuth CharnsethikulProblem Statement: The problem of allocating a set of items in order to maximize the toal linear profit under uncertain capacity referred as a stochastic knapsack problem with continuous random capacity was studied theoretically and computationally. Approach: Two optimization based heuristic algorithms were proposed and developed for solving the problem and both efficiency and effectiveness are compared with the general … …Journal of Mathematics and Statistics, Vol. 4, Issue 4 · 31 Dec 2008 · 6,946 accessesView PDFCite
Research ArticleOpen accessPhrase in the titleAn Exact Algorithm for the Unbounded Knapsack Problem with Minimizing Maximum Processing TimeChanin Srisuwannapa, Peerayuth CharnsethikulWe address a variant of the unbounded knapsack problem (UKP) into which the processing time of each item is also put and considered, referred as MMPTUKP. The MMPTUKP is a decision problem of allocating amount of n items, such that the maximum processing time of the selected items is minimized and the total profit is gained as at least as … …Journal of Computer Science, Vol. 3, Issue 3 · 31 Mar 2007 · 7,595 accessesView PDFCite
Research ArticleOpen accessIn the abstractTowards Solving the Problem of Virtual Machine Placement in Cloud Computing: A Job Classification ApproachAuday Al-Dulaimy, Ahmed Zekri, Wassim Itani, Rached ZantoutCloud Computing is a paradigm that delivers services by providing an access to wide range of shared resources which are hosted in cloud data centers. One of the recent challenges in this paradigm is to enhance the energy efficiency in these data centers. In this study, a model that identifies common patterns for the jobs submitted to the cloud is … …Journal of Computer Science, Vol. 12, Issue 3 · 8 Apr 2016 · 7,283 accessesView PDFCite
Research ArticleOpen accessIn the abstractMaximally Distant Codes Allocation Using Chemical Reaction Optimization and Ant Colony Optimization AlgorithmsTaisir Eldos, Waleed Nazih, Aws KananError correcting codes, also known as error controlling codes, are set of codes with redundancy that allows detecting errors. This is quite useful in transmitting data over a noisy channel or when retrieving data from a storage with possible physical defects. The idea is to use a set of code words that are maximally distant from each other, hence reducing … …Journal of Computer Science, Vol. 11, Issue 8 · 5 Nov 2015 · 7,000 accessesView PDFCite
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,796 accessesView PDFCite
Research ArticleOpen accessIn the abstractPerformance Analysis of Multi Clustered Parallel Genetic Algorithm with Gray ValueP. Vishnu Raja, V. Murali BhaskaranProblem statement: Encoding is one of the major factors in genetic algorithms, for a complex problem the optimality for the problem is determined. The encoding mechanism is the initial step which forms the chromosome to form the best fit individuals in the entire population. The proposed method tries to encode the initial population by the binary encoding and by gray … …American Journal of Applied Sciences, Vol. 9, Issue 8 · 28 Jun 2012 · 7,163 accessesView PDFCite
Research ArticleOpen accessIn the abstractA New Cryptosystem Based on Factoring and Discrete Logarithm ProblemsE.S. Ismail, M.S.N. HijaziProblem statement: A cryptosystem allows a sender to send any confidential or private message using a receiver’s public key and later the receiver confirms the integrity of the received message using his secret key. Currently the existing cryptosystems were developed based on a single hard problem like factoring, discrete logarithm, residuosity, knapsack or elliptic curve discrete logarithm. Although these schemes … …Journal of Mathematics and Statistics, Vol. 7, Issue 3 · 18 Jul 2011 · 7,786 accessesView PDFCite
Research ArticleOpen accessIn the abstractEvaluation of a Dual-Purpose Chemical Applicator for Paddy FieldsMohammed Shu’aibu Abubakar, Desa Ahmad, Othman Jamarei et al.Problem statement: One of the major problems of rice production is the shortage of labor resulting from migration from rural to urban areas, making it very difficult to meet peak demands for paddy production. In most developing countries of Southeast Asia, agricultural mechanization of paddy field operation is mostly carried out using conventional machines. For example in rice production powerintensive … …American Journal of Applied Sciences, Vol. 8, Issue 4 · 18 Apr 2011 · 7,542 accessesView PDFCite