Sciweavers

1639 search results - page 176 / 328
» Anytime Heuristic Search
Sort
View
ICDCS
2008
IEEE
14 years 4 months ago
Utility-Based Opportunistic Routing in Multi-Hop Wireless Networks
—Recently, opportunistic routing (OR) has been widely used to compensate for the low packet delivery ratio of multi-hop wireless networks. Previous works either provide heuristic...
Jie Wu, Mingming Lu, Feng Li
IEEEPACT
2007
IEEE
14 years 4 months ago
Automatic Correction of Loop Transformations
Loop nest optimization is a combinatorial problem. Due to the growing complexity of modern architectures, it involves two increasingly difficult tasks: (1) analyzing the profita...
Nicolas Vasilache, Albert Cohen, Louis-Noël P...
ICDM
2002
IEEE
162views Data Mining» more  ICDM 2002»
14 years 3 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
14 years 11 days 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 11 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