315 search results - page 14 / 63 » A new heuristic to solve the one-warehouse N-retailer proble... |
SIBGRAPI
2008
IEEE
15 years 6 months ago
2008
IEEE
Recently, a new Pattern Recognition technique based on straight line segments (SLSs) was presented. The key issue in this new technique is to find a function based on distances b...
101
click to vote
CP
2007
Springer
15 years 6 months ago
2007
Springer
Searching for optimal solutions to a problem using lower bounds obtained from a relaxation is a common idea in Heuristic Search and Planning. In SAT and CSPs, however, explicit rel...
CC
2007
Springer
15 years 6 months ago
2007
Springer
Optimizing programs for modern multiprocessor or vector platforms is a major important challenge for compilers today. In this work, we focus on one challenging aspect: the SIMD ALI...
AAAI
2000
15 years 1 months ago
2000
One challenge for research in constraint-based scheduling has been to produce scalable solution procedures under fairly general representational assumptions. Quite often, the comp...
123
click to vote
CEC
2011
IEEE
13 years 11 months ago
2011
IEEE
—Constrained Genetic Programming (CGP) is a method of searching the Genetic Programming search space non-uniformly, giving preferences to certain subspaces according to some heur...