Sciweavers

2108 search results - page 23 / 422
» Constrained Heuristic Search
Sort
View
SARA
2007
Springer
15 years 6 months ago
DFS-Tree Based Heuristic Search
Abstract. In constraint satisfaction, local search is an incomplete method for finding a solution to a problem. Solving a general constraint satisfaction problem (CSP) is known to...
Montserrat Abril, Miguel A. Salido, Federico Barbe...
AAAI
2010
15 years 1 months ago
Searching Without a Heuristic: Efficient Use of Abstraction
g Without a Heuristic: Efficient Use of Abstraction Bradford Larsen, Ethan Burns, Wheeler Ruml Department of Computer Science University of New Hampshire Durham, NH 03824 USA blars...
Bradford John Larsen, Ethan Burns, Wheeler Ruml, R...
ICML
2002
IEEE
16 years 19 days ago
Pruning Improves Heuristic Search for Cost-Sensitive Learning
This paper addresses cost-sensitive classification in the setting where there are costs for measuring each attribute as well as costs for misclassification errors. We show how to ...
Valentina Bayer Zubek, Thomas G. Dietterich
AAAI
2012
13 years 2 months ago
Heuristic Search Comes of Age
In looking back on the last five to ten years of work in heuristic search a few trends emerge. First, there has been a broadening of research topics studied. Second, there has be...
Nathan R. Sturtevant, Ariel Felner, Maxim Likhache...
FLAIRS
2007
15 years 2 months ago
Search Ordering Heuristics for Restarts-Based Constraint Solving
Constraint Satisfaction Problems are ubiquitous in Artificial Intelligence. Over the past decade significant advances have been made in terms of the size of problem instance tha...
Margarita Razgon, Barry O'Sullivan, Gregory M. Pro...