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

40 results for “heuristic algorithms”
Set a search alert
Research ArticleOpen accessIn the abstractNew Graph Coloring AlgorithmsHussein Al-Omari, Khair E. SabriTwo new heuristic graph-coloring algorithms, based on known heuristic algorithms, have been introduced. One of them is a modification of the Largest Degree Ordering (LDO) algorithm, and the other one is a modification of the Saturation Degree Ordering (SDO) algorithm. The two new algorithms proposed in this paper, were compared empirically, in terms of used colors, with some of the … …Journal of Mathematics and Statistics, Vol. 2, Issue 4 · 31 Dec 2007 · 7,044 accessesView PDFCite
Research ArticleOpen accessIn the abstractCustomized Privacy Preservation Using Unknowns to Stymie Unearthing Of Association RulesJ. Indumathi, G.V. UmaThe explosions of new data mining techniques has augmented privacy risks because now it is probable to powerfully coalesce and cross-examine massive data stores, accessible on the web, in the rummage around of earlier unidentified hidden patterns. Consecutively to make a overtly accessible system safe and sound, we must guarantee not only that private sensitive data have been trimmed out, … …Journal of Computer Science, Vol. 3, Issue 11 · 30 Nov 2007 · 7,117 accessesView PDFCite
Research ArticleOpen accessIn the abstractExperimental Comparison Between Evolutionary Algorithm and Barycenter Heuristic for the Bipartite Drawing ProblemZoheir EzzianeThis research investigates the use of intelligent techniques for the bipartite drawing problem (BDP). Due to the combinatorial nature of the solution space, the use of traditional search methods lead to exponential time. Hence, the aim of this paper is to speed up the search time when solving the BDP through the use of Evolutionary Algorithms (EAs) and Barycenter Heuristic … …Journal of Computer Science, Vol. 3, Issue 9 · 30 Sep 2007 · 6,716 accessesView PDFCite
Research ArticleOpen accessIn the abstractA Scheduling Algorithm Based on Petri Nets and Simulated AnnealingRachida Hadiby Ghoul, Abdelhamid Benjelloul, Sihem Kechida, Hicham TebbikhThis study aims at presenting a hybrid Flexible Manufacturing System "HFMS" short-term scheduling problem. Based on the art state of general scheduling algorithms, we present the meta-heuristic, we have decided to apply for a given example of HFMS. That was the study of Simulated Annealing Algorithm SA. The HFMS model based on hierarchical Petri nets, was used to represent static … …American Journal of Applied Sciences, Vol. 4, Issue 5 · 31 May 2007 · 7,164 accessesView PDFCite
Research ArticleOpen accessIn the abstractHybrid Optimize Strategy based QoS Route Algorithm for Mobile Ad hoc NetworksFu Peng, Zhang DeyunIt is very difficult to find feasible QoS (Quality of service) routes in the mobile ad hoc networks (MANETs), because of the nature constrains of it, such as dynamic network topology, wireless communication link and limited process capability of nodes. In order to reduce average cost in flooding path discovery scheme of the traditional MANETs routing protocols and increase the … …Journal of Computer Science, Vol. 2, Issue 2 · 28 Feb 2006 · 6,546 accessesView PDFCite
Research ArticleOpen accessIn the abstractApplication of Harmony Search to Vehicle RoutingZong Woo Geem, Kang Seok Lee, Yongjin ParkA phenomenon-inspired meta-heuristic algorithm, harmony search, imitating music improvisation process, is introduced and applied to vehicle routing problem, then compared with one of the popular evolutionary algorithms, genetic algorithm. The harmony search algorithm conceptualized a group of musicians together trying to search for better state of harmony. This algorithm was applied to a test traffic network composed of one bus … …American Journal of Applied Sciences, Vol. 2, Issue 12 · 31 Dec 2005 · 12,460 accessesView PDFCite
Research ArticleOpen accessAll words, across the recordA Great Deluge Algorithm with Bi-Decay Rate for Efficient Task Scheduling in Grid ComputingKaiLun Eng, Abdullah Muhammed, Sazlinah Hasan, Mohamad Afendee MohamedTo realise the utmost idea of global collaborative resource sharing with Grid computing, the fundamental scheduling process is playing a critical role. However, scheduling in Grid computing environment is a well-known NP-complete problem. In this study, we propose a new extension of Great Deluge algorithm with an effective diversification strategy for the Grid scheduling problem. The proposed approach, namely BiGD, … …Journal of Computer Science, Vol. 15, Issue 3 · 7 Mar 2019 · 7,720 accessesView PDFCite
Research ArticleOpen accessAll words, across the recordAN OPTIMIZATION-BASED HEURISTIC FOR A CAPACITATED LOT-SIZING MODEL IN AN AUTOMATED TELLER MACHINES NETWORKSupatchaya Chotayakul, Peerayuth Charnsetthikul, Juta Pichitlamken, John KobzaThis research studies a cash inventory problem in an ATM Network to satisfy customer’s cash needs over multiple periods with deterministic demand. The objective is to determine the amount of money to place in Automated Teller Machines (ATMs) and cash centers for each period over a given time horizon. The algorithms are designed as a multi-echelon inventory problem with single-item … …Journal of Mathematics and Statistics, Vol. 9, Issue 4 · 1 Oct 2013 · 7,049 accessesView PDFCite
Research ArticleOpen accessAll words, across the recordEnhanced Clustering Techniques for Hyper Network Planning using Minimum Spanning Trees and Ant-Colony AlgorithmLamiaa Fattouh IbrahimProblem statement: The process of network planning is divided into two sub steps. The first step is determining the location of the Multi Service Access Node (MSAN). The second step is the construction of subscriber network lines from MSAN to subscribers to satisfy optimization criteria and design constraints. Due to the complexity of this process artificial intelligence and clustering techniques … …Journal of Computer Science, Vol. 7, Issue 3 · 9 Mar 2011 · 6,813 accessesView PDFCite
Research ArticleOpen accessAll words, across the recordAn Iterative Method for Algorithms Implementation on a Limited Dynamically Reconfigurable HardwareAbdellatif Mtibaa, Abdessalem B. Abdelali, Lotfi Boussaid, Elbey BourennaneIn this study we propose a framework and a combined temporal partitioning and design space exploration method for run time reconfigurable processors. Our objective is to help designers to implement an algorithm in limited FPGA area resources while respecting the execution time constraint. The algorithm to be implemented is represented by a task graph with different implementation alternatives (design points) … …Journal of Computer Science, Vol. 2, Issue 5 · 31 May 2006 · 6,536 accessesView PDFCite