121 search results - page 5 / 25 » Improving branch-and-cut performance by random sampling |
COMPGEOM
1999
ACM
15 years 2 months ago
1999
ACM
Several motion planning methods using networks of randomly generated nodes in the free space have been shown to perform well in a number of cases, however their performance degrad...
PKDD
2001
Springer
15 years 2 months ago
2001
Springer
Large amount of available information does not necessarily imply that induction algorithms must use all this information. Samples often provide the same accuracy with less computat...
88
Voted
IROS
2006
IEEE
15 years 4 months ago
2006
IEEE
- Monte Carlo localization is known to be one of the most reliable methods for pose estimation of a mobile robot. Many studies have been conducted to improve performance of MCL. Al...
95
Voted
ECIR
2009
Springer
15 years 7 months ago
2009
Springer
Abstract. Learning ranking functions is crucial for solving many problems, ranging from document retrieval to building recommendation systems based on an individual user’s prefer...
111
click to vote
CIKM
2010
Springer
14 years 9 months ago
2010
Springer
In image retrieval, most existing approaches that incorporate local features produce high dimensional vectors, which lead to a high computational and data storage cost. Moreover, ...