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

28 results for “Heuristics”
Set a search alert
Research ArticleOpen accessIn the abstractExplicit Allocation Strategy with Deadline and Budget Constraint Algorithm in Bag of Tasks GridM. Suresh Kumar, T. PurusothamanProblem statement: This study is for effective scheduling of grid jobs based on economy for space shared resources in Bag of tasks grid. Grid Computing aims in combining the power of heterogeneous, geographically distributed, multi-domain computational resources to provide high performance or high throughput. Approach: Space shared resources are parallel supercomputers and clusters of workstations that provides a great amount … …Journal of Computer Science, Vol. 8, Issue 7 · 7 Jun 2012 · 6,229 accessesView PDFCite
Research ArticleOpen accessIn the abstractFeature Subset Selection for Hot Method Prediction using Genetic Algorithm wrapped with Support Vector MachinesSandra Johnson, Valli ShanmugamProblem statement: All compilers have simple profiling-based heuristics to identify and predict program hot methods and also to make optimization decisions. The major challenge in the profile-based optimization is addressing the problem of overhead. The aim of this work is to perform feature subset selection using Genetic Algorithms (GA) to improve and refine the machine learnt static hot method predictive … …Journal of Computer Science, Vol. 7, Issue 5 · 7 May 2011 · 7,234 accessesView PDFCite
Research ArticleOpen accessIn the abstractToponym Disambiguation by Arborescent RelationshipsImene Bensalem, Mohamed-Khireddine KholladiProblem statement: The way of referring to a place in the geographical space can be formal, based on the spatial coordinates, or informal, which we use in natural language by using toponyms (place names). A toponym can represent several geographical places. This ambiguity made problematic its conversion towards a unique formal representation. Toponym disambiguation in text is the task of … …Journal of Computer Science, Vol. 6, Issue 6 · 30 Jun 2010 · 7,667 accessesView PDFCite
Research ArticleOpen accessIn the abstractOn Calculating Activity Slack in Stochastic Project NetworksGary MitchellProblem statement: Identifying critical tasks in a project network is easily done when task times are deterministic, but doing so under stochastic task times is problematic. The few methods that have been proposed contain serious drawbacks which lead to identifying critical tasks incorrectly, leaving project managers without the means to (1) identify and rank the most probable sources of project … …American Journal of Economics and Business Administration, Vol. 2, Issue 1 · 31 Mar 2010 · 8,227 accessesView PDFCite
Research ArticleOpen accessIn the abstractOptimized Crossover Genetic Algorithm for Vehicle Routing Problem with Time WindowsH. Nazif, L.S. LeeProblem statement: In this study, we considered the application of a genetic algorithm to vehicle routing problem with time windows where a set of vehicles with limits on capacity and travel time are available to service a set of customers with demands and earliest and latest time for serving. The objective is to find routes for the vehicles to service … …American Journal of Applied Sciences, Vol. 7, Issue 1 · 31 Jan 2010 · 8,975 accessesView PDFCite
Research ArticleOpen accessIn the abstractAnalyzing the Peer to Peer Traffic Aggregation Using an Optimized MethodM. Sadish Sendil, N. NagarajanProblem statement: In the recent years, peer to peer networks have rapidly developed in the distributed and decentralized world of internet. Current research indicated that P2P applications were responsible for a substantial part of Internet traffic. Number of users embracing new P2P technology is also increasing fast. It is therefore important to understand the impact of the new P2P services … …Journal of Computer Science, Vol. 5, Issue 10 · 31 Oct 2009 · 6,607 accessesView PDFCite
Research ArticleOpen accessIn the abstractTraveling Salesman Approach for Solving Petrol Distribution Using Simulated AnnealingZuhaimy Ismail, Wan Rohaizad Wan IbrahimThis research presents an attempt to solve a logistic company's problem of delivering petrol to petrol station in the state of Johor. This delivery system is formulated as a travelling salesman problem (TSP). TSP involves finding an optimal route for visiting stations and returning to point of origin, where the inter-station distance is symmetric and known. This real world application … …American Journal of Applied Sciences, Vol. 5, Issue 11 · 30 Nov 2008 · 7,194 accessesView PDFCite
Research ArticleOpen accessIn the abstractUtilization of AODV in Wireless Ad Hoc NetworksZeyad M. Alfawaer, GuiWei Hua, Nidal A. HamdehAODV is a mature and widely accepted routing protocol for Mobile Ad hoc Networks (MANET), it has low processing and memory overhead and low network utilization, and works well even in high mobility situation. We modified AODV to use these dominating sets, resulting in the AODV-DS protocol. Our contribution in addressing the fragility of a minimum connected dominating set in … …Journal of Computer Science, Vol. 3, Issue 4 · 30 Apr 2007 · 7,160 accessesView PDFCite