Research ArticleOpen accessIn the abstractEFFECTIVE HEURISTIC ALGORITHM FOR DYNAMIC ROUTING AND BANDWIDTH MANAGEMENT UNDER QUALITY OF SERVICE CONSTRAINTS IN MULTISTAGE INTERCONNECTION NETWORKSR. Deepalakshmi, S. RajaramToday, Internet of Things (IoT) has introduced abundant bandwidth consumption and necessities in multimedia communications from online games to video-conferencing applications with the constraint of QoS requirements from time to time. The expected rapid proliferation of services would require performance unprecedented in the currently available best-effort routing algorithms. In, particular, the present routing mechanisms are based on the best-effort paradigm … …American Journal of Applied Sciences, Vol. 11, Issue 3 · 7 Jan 2014 · 7,138 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,083 accessesView PDFCite
Research ArticleOpen accessIn the abstractAN EFFICIENT CELL PLACEMENT USING GRAVITATIONAL SEARCH ALGORITHMSRose Al Qasem, Taisir EldosIn modern chip design, cell placement is a stage in which cells representing well-defined functions are assigned physical locations, in a way that optimizes the total area and routing length. Cell placement is an NP-complete problem and the exact solution is generally far from reach for a practically sized instance. Hence, diversified heuristic algorithms are used to solve this problem. … …Journal of Computer Science, Vol. 9, Issue 8 · 25 Jun 2013 · 7,371 accessesView PDFCite
Research ArticleOpen accessIn the abstractDynamic Scheduling for Cloud Reliability using Transportation ProblemS. K. Senthil Kumar, P. BalasubramanieProblem statement: Cloud is purely a dynamic environment and the existing task scheduling algorithms are mostly static and considered various parameters like time, cost, make span, speed, scalability, throughput, resource utilization, scheduling success rate and so on. Available scheduling algorithms are mostly heuristic in nature and more complex, time consuming and does not consider reliability and availability of the cloud … …Journal of Computer Science, Vol. 8, Issue 10 · 23 Aug 2012 · 8,332 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 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,565 accessesView PDFCite
Research ArticleOpen accessIn the abstractSolving the Traveling Salesman Problem Using New Operators in Genetic AlgorithmsNaef Taher Al Rahedi, Jalal AtoumProblem statement: Genetic Algorithms (GAs) have been used as search algorithms to find near-optimal solutions for many NP problems. GAs require effective chromosome representations as well as carefully designed crossover and mutation operators to achieve an efficient search. The Traveling Salesman Problem (TSP), as an NP search problem, involves finding the shortest Hamiltonian Path or Cycle in a graph of … …American Journal of Applied Sciences, Vol. 6, Issue 8 · 31 Aug 2009 · 7,584 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,845 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,946 accessesView PDFCite
Research ArticleOpen accessIn the abstractHeuristic 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