Sciweavers

603 search results - page 18 / 121
» DFS-Tree Based Heuristic Search
Sort
View
FLAIRS
2007
14 years 12 months ago
Case-Based Recommendation of Node Ordering in Planning
Currently, among the fastest approaches to AI task planning we find many forward-chaining heuristic planners, as FF. Most of their good performance comes from the use of domain-i...
Tomás de la Rosa, Angel García Olaya...
IPL
2006
80views more  IPL 2006»
14 years 9 months ago
BubbleSearch: A simple heuristic for improving priority-based greedy algorithms
We introduce BubbleSearch, a general approach for extending priority-based greedy heuristics. Following the framework recently developed by Borodin et al., we consider priority al...
Neal Lesh, Michael Mitzenmacher
79
Voted
ESANN
2006
14 years 11 months ago
On the selection of hidden neurons with heuristic search strategies for approximation
Abstract. Feature Selection techniques usually follow some search strategy to select a suitable subset from a set of features. Most neural network growing algorithms perform a sear...
Ignacio Barrio, Enrique Romero, Lluís A. Be...
AI
2002
Springer
14 years 9 months ago
Improving heuristic mini-max search by supervised learning
This article surveys three techniques for enhancing heuristic game-tree search pioneered in the author's Othello program Logistello, which dominated the computer Othello scen...
Michael Buro
COCOON
2007
Springer
15 years 3 months ago
Seed-Based Exclusion Method for Non-coding RNA Gene Search
Given an RNA family characterized by conserved sequences and folding constraints, the problem is to search for all the instances of the RNA family in a genomic database. As seed-ba...
Jean-Eudes Duchesne, Mathieu Giraud, Nadia El-Mabr...