Sciweavers

2108 search results - page 60 / 422
» Constrained Heuristic Search
Sort
View
WEA
2004
Springer
129views Algorithms» more  WEA 2004»
15 years 7 months ago
Experimental Comparison of Greedy Randomized Adaptive Search Procedures for the Maximum Diversity Problem
Abstract. The maximum diversity problem (MDP) consists of identifying optimally diverse subsets of elements from some larger collection. The selection of elements is based on the d...
Geiza C. Silva, Luiz Satoru Ochi, Simone L. Martin...
GECCO
2006
Springer
201views Optimization» more  GECCO 2006»
15 years 5 months ago
Selective self-adaptive approach to ant system for solving unit commitment problem
This paper presents a novel approach to solve the constrained unit commitment problem using Selective Self-Adaptive Ant System (SSAS) for improving search performance by automatic...
Songsak Chusanapiputt, Dulyatat Nualhong, Sujate J...
AAAI
1994
15 years 3 months ago
In Search of the Best Constraint Satisfaction Search
We present the results of an empirical study of several constraint satisfaction search algorithms and heuristics. Using a random problem generator that allows us to create instanc...
Daniel Frost, Rina Dechter
CSCLP
2005
Springer
15 years 3 months ago
Analysis of Heuristic Synergies
“Heuristic synergy” refers to improvements in search performance when the decisions made by two or more heuristics are combined. This paper considers combinations based on prod...
Richard J. Wallace
AIPS
2010
15 years 4 months ago
The More, the Merrier: Combining Heuristic Estimators for Satisficing Planning
The problem of effectively combining multiple heuristic estimators has been studied extensively in the context of optimal planning, but not in the context of satisficing planning....
Gabriele Röger, Malte Helmert