466 search results - page 41 / 94 » Preprocessing Search Spaces for Branch and Bound Search |
199
click to vote
RTA
1997
Springer
15 years 10 months ago
1997
Springer
In the development of algorithms for finding the minimal solutions of systems of linear Diophantine equations, little use has been made (to our knowledge) of the results by Stanle...
158
click to vote
IJCAI
2007
15 years 7 months ago
2007
The Valued (VCSP) framework is a generic optimization framework with a wide range of applications. Soft arc consistency operations transform a VCSP into an equivalent problem by s...
181
click to vote
AIPS
2006
15 years 7 months ago
2006
We present a new algorithm for conformant probabilistic planning, which for a given horizon produces a plan that maximizes the probability of success under quantified uncertainty ...
218
click to vote
COMPGEOM
2010
ACM
15 years 11 months ago
2010
ACM
In this paper, we introduce a simple, randomized dynamic data structure for storing multidimensional point sets, called a quadtreap. This data structure is a randomized, balanced ...
195
click to vote
ICIP
1995
IEEE
16 years 7 months ago
1995
IEEE
A real-world computer vision module must deal with a wide variety of environmental parameters. Object recognition, one of the major tasks of this vision module, typically requires...