Sciweavers

1047 search results - page 46 / 210
» Searching Without a Heuristic: Efficient Use of Abstraction
Sort
View
CLOUDCOM
2010
Springer
13 years 5 months ago
Scaling Populations of a Genetic Algorithm for Job Shop Scheduling Problems Using MapReduce
Inspired by Darwinian evolution, a genetic algorithm (GA) approach is one of the popular heuristic methods for solving hard problems, such as the Job Shop Scheduling Problem (JSSP...
Di-Wei Huang, Jimmy Lin
WAE
2000
103views Algorithms» more  WAE 2000»
13 years 9 months ago
Lattice Basis Reduction with Dynamic Approximation
Abstract. In this paper we present a heuristic based on dynamic approximations for improving the well-known Schnorr-Euchner lattice basis reduction algorithm. In particular, the ne...
Werner Backes, Susanne Wetzel
VLDB
2002
ACM
138views Database» more  VLDB 2002»
13 years 7 months ago
Adaptable Similarity Search using Non-Relevant Information
Many modern database applications require content-based similarity search capability in numeric attribute space. Further, users' notion of similarity varies between search se...
T. V. Ashwin, Rahul Gupta, Sugata Ghosal
BIBE
2007
IEEE
110views Bioinformatics» more  BIBE 2007»
14 years 2 months ago
Discrete Methods for Association Search and Status Prediction in Genotype Case-Control Studies
Abstract—Recent improvements in high-throughput genotyping technology make possible genome-wide association studies and status prediction (classification) for common complex dis...
Dumitru Brinza, Alexander Zelikovsky
ECP
1997
Springer
103views Robotics» more  ECP 1997»
13 years 12 months ago
Plan-Refinement Strategies and Search-Space Size
During the planning process, a planner may have many options for refinements to perform on the plan being developed. The planner’s efficiency depends on how it chooses which ref...
Reiko Tsuneto, Dana S. Nau, James A. Hendler