860 search results - page 126 / 172 » Biased Random Walks |
IJCNN
2006
IEEE
15 years 3 months ago
2006
IEEE
—A new application of the NN ensemble technique to improve the accuracy and stability of the calculation of NN emulation Jacobians is presented. The term “emulation” is defin...
ASIACRYPT
2005
Springer
15 years 3 months ago
2005
Springer
Let X1, X2, . . . , Xk be independent n bit random variables. If they have arbitrary distributions, we show how to compute distributions like Pr{X1 ⊕ X2 ⊕ · · · ⊕ Xk} and ...
IJCAI
2001
14 years 11 months ago
2001
New methods to generate hard random problem instances have driven progress on algorithms for deduction and constraint satisfaction. Recently Achlioptas et al. (AAAI 2000) introduc...
JAL
2008
14 years 9 months ago
2008
An important class of heuristics for constraint satisfaction problems works by sampling information during search in order to inform subsequent decisions. One of these strategies, ...
SIAMDM
2010
14 years 8 months ago
2010
Abstract. We investigate the degree distribution resulting from graph generation models based on rank-based attachment. In rank-based attachment, all vertices are ranked according ...