Sciweavers

860 search results - page 16 / 172
» Biased Random Walks
Sort
View
ENDM
2006
70views more  ENDM 2006»
13 years 11 months ago
Quasirandomness in Graphs
Jim Propp's rotor router model is a simple deterministic analogue of a random walk. Instead of distributing chips randomly, it serves the neighbors in a fixed order. We analy...
Benjamin Doerr, Tobias Friedrich
CSC
2008
14 years 10 days ago
On the Random Walks of Geometrical Forms in Two-Dimensions
I show how to design the value of the diffusion constant D for the random walks of Squares and Triangles over their respective regular lattice in two-dimensions. By allowing moveme...
J. F. Nystrom
CORR
2010
Springer
185views Education» more  CORR 2010»
13 years 11 months ago
Estimating and Sampling Graphs with Multidimensional Random Walks
Estimating characteristics of large graphs via sampling is a vital part of the study of complex networks. Current sampling methods such as (independent) random vertex and random w...
Bruno F. Ribeiro, Donald F. Towsley
INEX
2007
Springer
14 years 5 months ago
Structured Document Retrieval, Multimedia Retrieval, and Entity Ranking Using PF/Tijah
CWI and University of Twente used PF/Tijah, a flexible XML retrieval system, to evaluate structured document retrieval, multimedia retrieval, and entity ranking tasks in the conte...
Theodora Tsikrika, Pavel Serdyukov, Henning Rode, ...
GECCO
2004
Springer
14 years 4 months ago
On the Strength of Size Limits in Linear Genetic Programming
Abstract. Bloat is a common and well studied problem in genetic programming. Size and depth limits are often used to combat bloat, but to date there has been little detailed explor...
Nicholas Freitag McPhee, Alex Jarvis, Ellery Fusse...