1185 search results - page 46 / 237 » The Equivalence of Sampling and Searching |
CRV
2006
IEEE
14 years 1 months ago
2006
IEEE
This paper considers the problem of shape-from-shading using nearby planar distributed illuminants. It is shown that a rectangular planar nearby distributed uniform isotropic illu...
SIGSOFT
2009
ACM
14 years 8 months ago
2009
ACM
We propose a new algorithm for verifying concurrent programs, which uses concrete executions to partition the program into a set of lean partitions called concurrent trace program...
ILP
2004
Springer
14 years 1 months ago
2004
Springer
Recent statistical performance surveys of search algorithms in difficult combinatorial problems have demonstrated the benefits of randomising and restarting the search procedure. ...
ASP
2005
Springer
14 years 1 months ago
2005
Springer
Answer Set Programming (ASP) and propositional satisfiability (SAT) are closely related. In some recent work we have shown that, on a wide set of logic programs called “tight”...
DAM
2008
13 years 7 months ago
2008
: We consider a problem of searching an element in a partially ordered set (poset). The goal is to find a search strategy which minimizes the number of comparisons. Ben-Asher, Farc...