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

64 articles for “Heuristic algorithm”

Set a search alert
Also matching:1 special issue
Research ArticleOpen accessIn the abstractCONGESTION MANAGEMENT BY OPTIMAL ALLOCATION OF FACTS CONTROLLERS USING HYBRID FISH BEE OPTIMIZATIONS. Thangalakshmi, P. ValsalalThe role of Independent System Operator (ISO) in the restructured power industry includes system control, capacity planning, transmission tariff and congestion management; the challenging task being minimizing the congestion. One of the popular techniques used to alleviate congestion is using Flexible AC Transmission Systems (FACTS) devices. The power system generally operates near its rated capacity in deregulated market because of … …Journal of Computer Science, Vol. 10, Issue 9 · 24 Apr 2014 · 6,648 accessesView PDFCite
Research ArticleOpen accessIn the abstractAn Efficient Unified K-Means Clustering Technique for Microarray Gene Expression DataP. Valarmathie, K. Dinakaran, T. RavichandranProblem statement: Using microarray techniques one could monitor the expressions levels of thousands of genes simultaneously. One challenge was how to derive meaningful insights into expressed data. This might be carried out by clustering techniques such as hierarchical and k-means, but most of the clustering techniques were largely heuristic in nature and are associated with some unresolved issues like how … …Journal of Computer Science, Vol. 7, Issue 7 · 28 Jun 2011 · 6,915 accessesView PDFCite
Research ArticleOpen accessIn the abstractA 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,951 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,548 accessesView PDFCite
Research ArticleOpen accessIn the abstractAssisted History Matching for Petroleum Reservoirs in the Social Computing EraMichel Cancelliere, Dario Viberti, Francesca VergaThe exploitation strategy of hydrocarbon reservoirs can be technically and economically optimized only if a reliable numerical model of the reservoir under investigation is available to predict the system response for different production scenarios. A numerical model can be reasonably trustworthy after calibration only, which means the model has at least proved its ability to reproduce the historical behavior of … …American Journal of Applied Sciences, Vol. 10, Issue 8 · 24 Jul 2013 · 7,089 accessesView PDFCite
Research ArticleOpen accessIn the abstractIntegrated Resource and Cost Management Scheme for Computational GridsV. K. Manavalasundaram, K. DuraiswamyProblem statement: Autonomous decision making and resource scheduling are the main objectives of market-life computational grid. Resource providers and consumers make the scheduling decisions with cost and incentive factors. The two objectives are to maximize the success rate of job execution and to minimize fairness deviation among resources. The challenge is to develop a grid-scheduling scheme that enables individual participants … …Journal of Computer Science, Vol. 8, Issue 4 · 7 Feb 2012 · 6,570 accessesView PDFCite
Research ArticleOpen accessIn the abstractProgressive Content-Sensitive Data Retrieval in Sensor NetworksBo Yang, Manohar MareboyanaProblem statement: For a sensor network comprising autonomous and self-organizing data sources, efficient similarity-based search for semantic-rich resources (such as video data) has been considered as a challenging task due to the lack of infrastructures and the multiple limitations (such as band-width, storage and energy). While the past research discussed much on routing protocols for sensor networks, few works have … …Journal of Computer Science, Vol. 5, Issue 7 · 31 Jul 2009 · 6,849 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,121 accessesView PDFCite
Research ArticleOpen accessAll words, across the recordImproved Meta-Heuristic for Multi-Objective Integrated Procurement, Production and Distribution Problem of Supply Chain Network Under Fuzziness UncertaintiesKaoutar Douaioui, Mouhsene Fri, Charif Mabrouki, El Alami SemmaIn this study, we devoted a design under uncertainty of a supply chain network composed of multiple suppliers, multiple plants, multiple distributors and multiple customers. The proposed model is a bi- objective mixed integer linear programming which consider several constraints and optimize the total costs including the procurement, production, storage and distribution costs as well as maximize on-time deliveries. In … …Journal of Computer Science, Vol. 17, Issue 12 · 27 Dec 2021 · 6,633 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,727 accessesView PDFCite