Sciweavers

2108 search results - page 69 / 422
» Constrained Heuristic Search
Sort
View
ICTAI
2009
IEEE
14 years 11 months ago
Stochastic Offline Programming
We propose a framework which we call stochastic offline programming (SOP). The idea is to embed the development of combinatorial algorithms in an off-line learning environment whi...
Yuri Malitsky, Meinolf Sellmann
IJCBDD
2008
113views more  IJCBDD 2008»
15 years 1 months ago
Parsimony accelerated Maximum Likelihood searches
: Phylogenetic search is a key tool used in a variety of biological research endeavors. However, this search problem is known to be computationally difficult, due to the astronomic...
Kenneth Sundberg, Timothy O'Connor, Hyrum Carroll,...
GIS
2008
ACM
15 years 2 months ago
Heuristic algorithms for route-search queries over geographical data
In a geographical route search, given search terms, the goal is to find an effective route that (1) starts at a given location, (2) ends at a given location, and (3) travels via...
Yaron Kanza, Eliyahu Safra, Yehoshua Sagiv, Yerach...
IDA
2003
Springer
15 years 6 months ago
An Iterated Local Search Approach for Minimum Sum-of-Squares Clustering
Abstract. Since minimum sum-of-squares clustering (MSSC) is an NPhard combinatorial optimization problem, applying techniques from global optimization appears to be promising for r...
Peter Merz
IJCAI
1997
15 years 3 months ago
Automatic Generation of Heuristics for Scheduling
This paper presents a technique, called GENH, that automatically generates search heuristics for scheduling problems. The impetus for developing this technique is the growing cons...
Robert A. Morris, John L. Bresina, Stuart M. Rodge...