Sciweavers

6976 search results - page 100 / 1396
» The Oil Searching Problem
Sort
View
163
Voted
AAAI
1996
15 years 7 months ago
Improved Limited Discrepancy Search
We present an improvement to Harvey and Ginsberg's limited discrepancy search algorithm, which eliminates much of the redundancy in the original, by generating each path from...
Richard E. Korf
165
Voted
GECCO
2007
Springer
160views Optimization» more  GECCO 2007»
16 years 8 days ago
Quick-and-dirty ant colony optimization
Ant colony optimization (ACO) is a well known metaheuristic. In the literature it has been used for tackling many optimization problems. Often, ACO is hybridized with a local sear...
Paola Pellegrini, Elena Moretti
KR
2004
Springer
15 years 11 months ago
Breadth-First Heuristic Search
Recent work shows that the memory requirements of bestfirst heuristic search can be reduced substantially by using a divide-and-conquer method of solution reconstruction. We show...
Rong Zhou, Eric A. Hansen
WWW
2009
ACM
16 years 28 days ago
A probabilistic model based approach for blended search
In this paper, we propose to model the blended search problem by assuming conditional dependencies among queries, VSEs and search results. The probability distributions of this mo...
Ning Liu, Jun Yan, Zheng Chen
147
Voted
ICPR
2006
IEEE
16 years 7 months ago
Estimating the location of illuminants in realist master paintings Computer image analysis addresses a debate in art history of
In cast-shadow analysis one merely draws a line between each occluder and its associated shadow cast onto a different surface, possibly with wedges indicating precision. In some c...