1047 search results - page 23 / 210 » Searching Without a Heuristic: Efficient Use of Abstraction |
JSAT
2008
13 years 7 months ago
2008
We propose a new switching criterion, namely the evenness or unevenness of the distribution of variable weights, and use this criterion to combine intensification and diversificat...
CIAC
1994
Springer
13 years 11 months ago
1994
Springer
We consider the problem of maintaining a binary search tree (BST) that minimizes the average access cost needed to satisfy randomly generated requests. We analyze scenarios in whi...
IBERAMIA
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. In constraint satisfaction, a general rule is to tackle the hardest part of a search problem first. In this paper, we introduce a parameter (τ) that measures the constr...
DDECS
2007
IEEE
14 years 2 months ago
2007
IEEE
1-The increasing cost for System-on-Chip (SOC) testing is mainly due to the huge test data volumes that lead to long test application time and require large automatic test equipmen...
CAEPIA
2007
Springer
13 years 11 months ago
2007
Springer
Many recent successful planners use domain-independent heuristics to speed up the search for a valid plan. An orthogonal approach to accelerating search is to identify and remove r...