424 search results - page 78 / 85 » Boosted sampling: approximation algorithms for stochastic op... |
173
click to vote
AI
2011
Springer
14 years 10 months ago
2011
Springer
Planning graphs have been shown to be a rich source of heuristic information for many kinds of planners. In many cases, planners must compute a planning graph for each element of ...
150
click to vote
TMC
2012
13 years 6 months ago
2012
Abstract—In order to achieve data delivery in Delay Tolerant Networks (DTN), researchers have proposed the use of store-carryand-forward protocols: a node there may store a messa...
127
Voted
CORR
2012
Springer
13 years 11 months ago
2012
Springer
In this paper we consider the MAX-WEIGHT protocol for routing and scheduling in wireless networks under an adversarial model. This protocol has received a significant amount of a...
143
click to vote
IROS
2008
IEEE
15 years 10 months ago
2008
IEEE
— In this paper we investigate the usage of persistent point feature histograms for the problem of aligning point cloud data views into a consistent global model. Given a collect...
152
Voted
BMVC
2002
15 years 6 months ago
2002
Many computer vision algorithms include a robust estimation step where model parameters are computed from a data set containing a significant proportion of outliers. The RANSAC al...