Sciweavers

85 search results - page 9 / 17
» Non Uniform Random Walks
Sort
View
CORR
2010
Springer
162views Education» more  CORR 2010»
13 years 8 months ago
Random sampling of lattice paths with constraints, via transportation
We investigate Monte Carlo Markov Chain (MCMC) procedures for the random sampling of some one-dimensional lattice paths with constraints, for various constraints. We will see that...
Lucas Gerin
INFOCOM
2009
IEEE
14 years 3 months ago
Budget-Based Self-Optimized Incentive Search in Unstructured P2P Networks
—Distributed object search is the primary function of Peer-to-Peer (P2P) file sharing system to locate and transfer the file. The predominant search schemes in unstructured P2P...
Yi Hu, Min Feng, Laxmi N. Bhuyan, Vana Kalogeraki
AAAI
2008
13 years 11 months ago
Perpetual Learning for Non-Cooperative Multiple Agents
This paper examines, by argument, the dynamics of sequences of behavioural choices made, when non-cooperative restricted-memory agents learn in partially observable stochastic gam...
Luke Dickens
ISBI
2004
IEEE
14 years 9 months ago
Statistical Surface-Based Morphometry Using a Non-Parametric Approach
We present a novel method of statistical surface-based morphometry based on the use of non-parametric permutation tests. In order to evaluate morphologicaldifferences of brain str...
Dimitrios Pantazis, Richard M. Leahy, Thomas E. Ni...
JSAC
2007
124views more  JSAC 2007»
13 years 8 months ago
Optimal search performance in unstructured peer-to-peer networks with clustered demands
—This paper derives the optimal search time and the optimal search cost that can be achieved in unstructured peer-topeer networks when the demand pattern exhibits clustering (i.e...
Saurabh Tewari, Leonard Kleinrock