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

16 articles for “Combinatorial Approach”
Set a search alert
Research ArticleOpen accessIn the keywordsA COMBINTORIAL TREE BASED FREQUENT PATTERN MININGN. Yamuna Devi, J. Devi ShreeFrequent pattern mining is a process of extracting frequently occurring itemset patterns from very large data storages. These frequent patterns are used to generate association rules which define the relationship among items. The strength of the relationship can be measured using two different units namely support value and confidence level. Any relationship that satisfies minimum threshold of support value is … …Journal of Computer Science, Vol. 10, Issue 9 · 23 Jun 2014 · 6,804 accessesView PDFCite
Research ArticleOpen accessIn the abstractTAGN-IDC: Implicit Discrete Constraints for Tsunami Aware Graph Neural Networks in Spatial Evacuation RoutingSularno, Wendi Boy, Putri Anggraini et al.Tsunami evacuation route requires rapid identification of safe evacuation paths under dynamically changing hazard conditions. A major challenge is incorporating hard binary road-blockage constraints caused by tsunami inundation while maintaining end-to-end differentiability for deep learning models. Existing approaches commonly rely on continuous relaxations or stochastic sampling techniques, which either compromise physical feasibility or increase computational complexity. This study proposes the … …Journal of Computer Science, Vol. 22, Issue 9 · 24 Sep 2026 · 704 accessesView PDFCite
Literature ReviewOpen accessIn the abstractCombinatorial Interaction Testing of Software Product Lines: A Mapping StudyMohd Zanes Sahid, Abu Bakar Md Sultan, Abdul Azim Abdul Ghani, Salmi BaharomSoftware Product Line (SPL) is a software engineering paradigm that is inspired by the concept of reusability of common features, formulated for different software product. Complete testing on entire SPL is known to be unfeasible, due to the very large number of possible products to be produced, configured using a subset or all possible features in the SPL. This paper … …Journal of Computer Science, Vol. 12, Issue 8 · 20 Oct 2016 · 8,480 accessesView PDFCite
Research ArticleOpen accessIn the abstractReverse Pharmacology-A Paradigm Shift for Drug Discovery and DevelopmentAshok D.B. VaidyaThe current scenario of drug discovery and development is facing a model perturbation, despite significant advances in genomics, proteomics, metabolomics, combinatorial chemistry and high through put assays. There is an urgent need of a paradigm shift in approaches to drug discovery. Natural products of Ayurveda offer a vast potential for novel phytomolecules with clinical activity. In India, Ayurveda is availed … …Current Research in Drug Discovery, Vol. 1, Issue 2 · 26 Jan 2015 · 15,398 accessesView PDFCite
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,056 accessesView PDFCite
Research ArticleOpen accessIn the abstractAnt Colony Optimization for Capacitated Vehicle Routing ProblemW. F. Tan, L. S. Lee, Z. A. Majid, H. V. SeowProblem statement: The Capacitated Vehicle Routing Problem (CVRP) is a well-known combinatorial optimization problem which is concerned with the distribution of goods between the depot and customers. It is of economic importance to businesses as approximately 10-20% of the final cost of the goods is contributed by the transportation process. Approach: This problem was tackled using an Ant Colony Optimization … …Journal of Computer Science, Vol. 8, Issue 6 · 15 Mar 2012 · 10,043 accessesView PDFCite
Research ArticleOpen accessIn the abstractIntegration of Genetic Algorithm with Tabu Search for Job Shop Scheduling with Unordered Subsequence Exchange CrossoverR. Thamilselvan, P. BalasubramanieProblem statement: The problem of scheduling n jobs on m machines with each job having specific machine route has been researched over the decade. The Job Shop Scheduling (JSS) is one of the hardest combinatorial optimization problems. Each resource can process at most one job at a time. Approach: This study proposes a new approach to solve a Job Shop … …Journal of Computer Science, Vol. 8, Issue 5 · 24 Feb 2012 · 6,650 accessesView PDFCite
Research ArticleOpen accessIn the abstractTwo Reformulations for the Dynamic Quadratic Assignment ProblemSirirat Muenvanichakul, Peerayuth CharnsethikulProblem statement: The Dynamic Quadratic Assignment Problem (DQAP), an NP-hard problem, is outlined and reformulated in two alternative models: Linearized model and logic-based model. Approach: The solution methods for both models based on combinatorial methods (Benders’ Decomposition and Approximate Dynamic Programming) and constraint logic programming, respectively, are proposed. Results: Proofs of model equivalence and solution methodology are presented. Conclusion: Both … …Journal of Mathematics and Statistics, Vol. 6, Issue 4 · 31 Dec 2010 · 7,947 accessesView PDFCite
Research ArticleOpen accessIn the abstractThe Probability and the Asymptotic Distribution Functions of Increasing Ordered Statistical DataA. A. El-Faheem, Eman A. MahmoudProblem statement: We considered two types of sequences of ordered statistical discrete data i1, i2…in, 1≤i1≤ i2≤… in≤n and ij = 1,2,…,n, j = 1,2,…,n. The first type is the order statistics of a sample of size n taken from the uniform discrete distribution on the set S = {1,2,…,n}, n ∈ N+. The other type is the increasing ordered … …Journal of Mathematics and Statistics, Vol. 6, Issue 3 · 30 Sep 2010 · 7,290 accessesView PDFCite
Research ArticleOpen accessIn the abstractTree Based Test Case Generation and Cost Calculation Strategy for Uniform Parametric Pairwise TestingMohammad F.J. Klaib, Sangeetha Muthuraman, Noraziah Ahmad, Roslina SidekProblem statement: Although it is very important to test any system extensively it is usually too expensive to do so owing to the cost and the resources that are involved in it. Software testing is a very important phase of software development to ensure that the developed system is reliable. Some systematic approach for testing is essential to test any … …Journal of Computer Science, Vol. 6, Issue 5 · 31 May 2010 · 7,342 accessesView PDFCite