—The typical state-of-the-art routing algorithms for delay tolerant networks are based on best next hop hill-climbing heuristics in order to achieve throughput and efficiency. T...
Josep M. Pujol, Alberto Lopez Toledo, Pablo Rodrig...
We study the problem of how to allocate m identical items among n > m agents, assuming each agent desires exactly one item and has a private value for consuming the item. We as...
Geoffroy de Clippel, Victor Naroditskiy, Amy R. Gr...
Background: We present a statistical method of analysis of biological networks based on the exponential random graph model, namely p2-model, as opposed to previous descriptive app...
Svetlana Bulashevska, Alla Bulashevska, Roland Eil...
To date the most popular and sophisticated types of virtual worlds can be found in the area of video gaming, especially in the genre of Massively Multiplayer Online Role Playing Ga...
In this paper, we analyze the efficiency of Monte Carlo methods for incremental computation of PageRank, personalized PageRank, and similar random walk based methods (with focus o...