5580 search results - page 131 / 1116 » Randomized priority algorithms |
CPC
2007
14 years 10 months ago
2007
We show that a random 4-regular graph asymptotically almost surely (a.a.s.) has chromatic number 3. The proof uses an efficient algorithm which a.a.s. 3colours a random 4-regular ...
131
click to vote
MICCAI
2005
Springer
15 years 10 months ago
2005
Springer
A new approach to interactive segmentation based on random walks was recently introduced that shows promise for allowing physicians more flexibility to segment arbitrary objects in...
ICRA
2009
IEEE
15 years 4 months ago
2009
IEEE
— We suggest a new navigation approach to mobile robots, within a nonlinear model predictive control framework where a navigation function is used as a control Lyapunov function....
GECCO
2009
Springer
15 years 1 months ago
2009
Springer
We propose a simple approach to visualising the time behaviour of Random Boolean Networks (RBNs), and demonstrate the approach by examining the effect of canalising functions for ...
CORR
2011
Springer
14 years 1 months ago
2011
Springer
Let Φ be a uniformly distributed random k-SAT formula with n variables and m clauses. We prove that the Walksat algorithm from [16, 17] finds a satisfying assignment of Φ in pol...