2168 search results - page 91 / 434 » Randomized Algorithms and Complexity Theory |
120
click to vote
IROS
2009
IEEE
15 years 9 months ago
2009
IEEE
— Sampling-based motion planners are often used to solve very high-dimensional planning problems. Many recent algorithms use projections of the state space to estimate properties...
139
click to vote
EMMCVPR
1999
Springer
15 years 7 months ago
1999
Springer
Markov Random Fields are widely used in many image processing applications. Recently the shortcomings of some of the simpler forms of these models have become apparent, and models ...
100
click to vote
COCO
2010
Springer
15 years 7 months ago
2010
Springer
—In this paper we show that BPP is truth-table reducible to the set of Kolmogorov random strings RK . It was previously known that PSPACE, and hence BPP is Turingreducible to RK ...
139
click to vote
SAGT
2010
Springer
15 years 1 months ago
2010
Springer
We investigate the computational aspects of safe manipulation, a new model of coalitional manipulation that was recently put forward by Slinko and White [11]. In this model, a pot...
115
click to vote
CMSB
2006
Springer
15 years 6 months ago
2006
Springer
Having in mind the large-scale analysis of gene regulatory networks, we review a graph decimation algorithm, called "leaf-removal", which can be used to evaluate the feed...