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 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,672 accessesView PDFCite
Research ArticleOpen accessIn the abstractHow (Un)biased are Airport Security Screening Procedures? A Social-Cognitive ExperimentPoornima Madhavan, Jeremy R. BrownProblem statement: This research examined the role that social-cognitive biases such as gender biases and racial biases play in decision making processes during the screening of carry-on luggage at airports. This research is unique in that no research so far has addressed the social-psychological underpinnings of airport security screening procedures. Approach: Participants (n = 36) performed a computer simulated task … …Current Research in Psychology, Vol. 1, Issue 1 · 30 Jun 2010 · 8,013 accessesView PDFCite
Research ArticleOpen accessIn the abstractArtificial Neural Network Based Model for Forecasting Sugar Cane ProductionO. O. Obe, D. K. ShangodoyinProblem statement: The global need for alternative energy source has necessitated the exploration of vast organic agricultural products with a view of processing them for the production of ethanol in commercial quantity. To ascertain a sustainable production of ethanol from processed sugar cane, a predictive model based on non-linearity nature of its production is imperative. This is due to unavailability … …Journal of Computer Science, Vol. 6, Issue 4 · 30 Apr 2010 · 7,272 accessesView PDFCite
Research ArticleOpen accessIn the abstractLoad Balancing of Distributed Systems Based on Multiple Ant Colonies OptimizationAl-Dahoud Ali, Mohamed A. Belal, Moh’d Belal Al-ZoubiProblem statement: Ant Colony Optimization (ACO) provides a meta-heuristic optimization tool and collective intelligence model to several applications such as routing and load balancing. A lot of work found in the literature on using ACO in load balancing. However, as far as our knowledge, there was no work relating load balancing in distributed systems with ACO. Approach: In this study, … …American Journal of Applied Sciences, Vol. 7, Issue 3 · 31 Mar 2010 · 7,213 accessesView PDFCite
Research ArticleOpen accessIn the abstractSolving the State Assignment Problem Using Stochastic Search Aided with Simulated AnnealingWalid M. AlyProblem statement: Solving the state assignment problem means finding the optimum assignment for each state within a sequential digital circuit. These optimum assignments will result in decreasing the hardware realization cost and increasing the reliability of the digital circuit. Unfortunately, the state assignment problem belongs to the class of nondeterministic polynomial time problems (NP complete) which requires heavy computations. Different … …American Journal of Engineering and Applied Sciences, Vol. 2, Issue 4 · 31 Dec 2009 · 6,972 accessesView PDFCite
Research ArticleOpen accessIn the abstractOn the Predictability of Risk Box Approach by Genetic Programming Method for Bankruptcy PredictionAlireza Bahiraie, Noor Akma bt Ibrahim, A. K.M. AzharProblem statement: Theoretical based data representation is an important tool for model selection and interpretations in bankruptcy analysis since the numerical representation are much less transparent. Some methodological problems concerning financial ratios such as non-proportionality, non-asymetricity, non-scalicity are solved in this study and we presented a complementary technique for empirical analysis of financial ratios and bankruptcy risk. Approach: This study … …American Journal of Applied Sciences, Vol. 6, Issue 9 · 30 Sep 2009 · 7,953 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,589 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 abstractThe Coordinated Scheduling Support System of Production and DeliveryMing-Feng Yang, Yi LinProblem statement: Traditional scheduling models which only address the sequence of jobs to be processed at the production stage under some criteria are no longer suitable and should be extended to cope with the distribution stage after production. In a rapidly changing environment, competition among enterprises has a tendency to turn towards competing between supply chain systems instead of competing … …American Journal of Applied Sciences, Vol. 6, Issue 4 · 30 Apr 2009 · 6,803 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