6393 search results - page 946 / 1279 » Randomized Algorithms on the Mesh |
152
click to vote
NIPS
2008
15 years 6 months ago
2008
We show that an important and computationally challenging solution space feature of the graph coloring problem (COL), namely the number of clusters of solutions, can be accurately...
151
Voted
AAAI
2006
15 years 6 months ago
2006
We propose two new online methods for estimating the size of a backtracking search tree. The first method is based on a weighted sample of the branches visited by chronological ba...
166
click to vote
AIPS
2006
15 years 6 months ago
2006
In this paper, we present a motion planning framework for a fully deployed autonomous unmanned aerial vehicle which integrates two sample-based motion planning techniques, Probabi...
145
click to vote
DICTA
2003
15 years 6 months ago
2003
In this paper, we propose a robust method to estimate the fundamental matrix in the presence of outliers. The new method uses random minimum subsets as a search engine to find inli...
120
click to vote
FLAIRS
2003
15 years 6 months ago
2003
Freuder in (1991) defined interchangeability for classical Constraint Satisfaction Problems (CSPs). Recently (2002), we extended the definition of interchangeability to Soft CSP...