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

114 results for “Heuristic”
Set a search alert
Research ArticleOpen accessEvery word in the titleA Randomized Population Constructive Heuristic for the Team Orienteering ProblemManal ZettamThe NP-hard (complete) team orienteering problem is a particular vehicle routing problem with the aim of maximizing the profits gained from visiting control points without exceeding a travel cost limit. The team orienteering problem has a number of applications in several fields such as athlete recruiting, technician routing and tourist trip. Therefore, solving optimally the team orienteering problem would play … …Journal of Computer Science, Vol. 13, Issue 9 · 17 Jun 2017 · 8,285 accessesView PDFCite
Research ArticleOpen accessEvery word in the titleStatic Batch Mode Heuristic Algorithm for Mapping Independent Tasks in Computational GridR. Vijayalakshmi, V. VasudevanGrid computing plays an important role in solving large-scale computational problems in a high performance computing environment. Scheduling of tasks to efficient and best suitable resource is one of the most challenging phase in grid computing systems. Grid environment reveals several challenges in efficient scheduling of complex applications because of its heterogeneity, dynamic behavior and shared resources. Scheduling of independent … …Journal of Computer Science, Vol. 11, Issue 1 · 22 Sep 2014 · 7,429 accessesView PDFCite
Research ArticleOpen accessEvery word in the titleHEURISTIC DISCRETIZATION METHOD FOR BAYESIAN NETWORKSMariana D.C. Lima, Silvia M. Nassar, Pedro Ivo R.B.G. Rodrigues et al.Bayesian Network (BN) is a classification technique widely used in Artificial Intelligence. Its structure is a Direct Acyclic Graph (DAG) used to model the association of categorical variables. However, in cases where the variables are numerical, a previous discretization is necessary. Discretization methods are usually based on a statistical approach using the data distribution, such as division by quartiles. In … …Journal of Computer Science, Vol. 10, Issue 5 · 18 Jan 2014 · 7,054 accessesView PDFCite
Research ArticleOpen accessEvery word in the titleHeuristic Placement Routines for Two-Dimensional Bin Packing ProblemL. Wong, L. S. LeeProblem statement: Cutting and packing (C and P) problems are optimization problems that are concerned in finding a good arrangement of multiple small items into one or more larger objects. Bin packing problem is a type of C AND P problems. Bin packing problem is an important industrial problem where the general objective is to reduce the production costs by … …Journal of Mathematics and Statistics, Vol. 5, Issue 4 · 31 Dec 2009 · 7,701 accessesView PDFCite
Research ArticleOpen accessEvery word in the titleHeuristic Algorithm with Simulation Model for Searching Optimal Reservoir Rule CurvesAnongrit Kangrang, Sudarat Compliew, Witsanukorn ChaiyapoomThis study proposes a heuristic algorithm to connect with simulation model for searching the optimal reservoir rule curves. The proposed model was applied to determine the optimal rule curves of the Ubolratana reservoir (the Chi River Basin, Thailand). The results showed that the pattern of the obtained rule curves similar to the existing rule curve. Then the obtained rule curves … …American Journal of Applied Sciences, Vol. 6, Issue 2 · 28 Feb 2009 · 7,424 accessesView PDFCite
Research ArticleOpen accessEvery word in the titleHeuristic Algorithm in Optimal Discrete Structural DesignsAlongkorn Lamom, Thaksin Thepchatri, Wanchai RivepiboonThis study proposes a Heuristic Algorithm for Material Size Selection (HAMSS). It is developed to handle discrete structural optimization problems. The proposed algorithm (HAMSS), Simulated Annealing Algorithm (SA) and the conventional design algorithm obtained from a structural steel design software are studied with three selected examples. The HAMSS, in fact, is the adaptation from the traditional SA. Although the SA … …American Journal of Applied Sciences, Vol. 5, Issue 8 · 31 Aug 2008 · 7,345 accessesView PDFCite
Research ArticleOpen accessEvery word in the titleExperimental 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 accessEvery word in the titleImproving the Ranking Capability of the Hyperlink Based Search Engines Using Heuristic ApproachHaider A. Ramadhan, Khalil Shihab, Jafar H. AliTo evaluate the informative content of a Web page, the Web structure has to be carefully analyzed. Hyperlink analysis, which is capable of measuring the potential information contained in a Web page with respect to the Web space, is gaining more attention. The links to and from Web pages are an important resource that has largely gone unused in existing … …Journal of Computer Science, Vol. 2, Issue 8 · 31 Aug 2006 · 6,378 accessesView PDFCite
Literature ReviewOpen accessEvery word in the titleA Review on Heuristics for Addition Chain Problem: Towards Efficient Public Key CryptosystemsAdamu Muhammad Noma, Abdullah Muhammed, Mohamad Afendee Mohamed, Zuriati Ahmad ZulkarnainField exponentiation and scalar multiplication are the pillars of and the most computationally expensive operations in the public key cryptosystems. Optimizing the operation is the key to the efficiency of the systems. Analogous to the optimization is solving addition chain problem. In this study, we survey from the onset of the addition chain problem to the state-of-the-art heuristics for optimizing … …Journal of Computer Science, Vol. 13, Issue 8 · 1 Jun 2017 · 8,163 accessesView PDFCite
Research ArticleOpen accessEvery word in the titleServer Optimization Using Heuristic Algorithms for Dynamic-Split-and-Merge Scheme in Wireless MulticastR. Sukumar, V. VasudevanProblem statement: In order to minimize the overall network traffic in a multiserver system, the number of users served by each server (and hence the group size) should remain constant. As the underlying traffic fluctuates, a split and merge scheme is implemented in a physical server to achieve load balancing. Approach: Minimizing the number of servers during the merge operation … …Journal of Computer Science, Vol. 5, Issue 12 · 31 Dec 2009 · 6,811 accessesView PDFCite