Sciweavers

1589 search results - page 172 / 318
» Multiple-Goal Heuristic Search
Sort
View
ICDM
2002
IEEE
162views Data Mining» more  ICDM 2002»
14 years 2 months ago
Recognition of Common Areas in a Web Page Using Visual Information: a possible application in a page classification
Extracting and processing information from web pages is an important task in many areas like constructing search engines, information retrieval, and data mining from the Web. Comm...
Milos Kovacevic, Michelangelo Diligenti, Marco Gor...
WSC
2008
13 years 11 months ago
SR-1: A simulation-based algorithm for the Capacitated Vehicle Routing Problem
In this paper we present SR-1, a simulation-based heuristic algorithm for the Capacitated Vehicle Routing Problem (CVRP). Given a CVRP instance, SR-1 uses an initial "good so...
Javier Faulin, Miquel Gilibert, Angel A. Juan, Xav...
AAAI
2000
13 years 10 months ago
On Pruning Techniques for Multi-Player Games
Maxn (Luckhardt and Irani, 1986) is the extension of the minimax backup rule to multi-player games. We have shown that only a limited version of alpha-beta pruning, shallow prunin...
Nathan R. Sturtevant, Richard E. Korf
AIPS
2000
13 years 10 months ago
New Results about LCGP, a Least Committed GraphPlan
Planners from the family of Graphplan (Graphplan, IPP, STAN...) are presently considered as the most efficient ones on numerous planning domains. Their partially ordered plans can...
Michel Cayrol, Pierre Régnier, Vincent Vida...
IJCAI
1989
13 years 10 months ago
Goal Ordering in Partially Ordered Plans
Partially ordered plans have not solved the goal ordering problem. Consider: a goal in a par­ tially ordered plan is an operator precondition that is not yet achieved; operators,...
Mark Drummond, Ken Currie