2079 search results - page 133 / 416 » Universality of random graphs |
163
click to vote
INFOCOM
2010
IEEE
15 years 3 months ago
2010
IEEE
—In this paper we develop a unified theoretical framework for estimating various transmission costs of packet forwarding in wireless networks. Our framework can be applied to th...
166
click to vote
EMNLP
2011
14 years 4 months ago
2011
We consider the problem of performing learning and inference in a large scale knowledge base containing imperfect knowledge with incomplete coverage. We show that a soft inference...
128
click to vote
GECCO
2005
Springer
15 years 10 months ago
2005
Springer
We present discrete stochastic mathematical models for the growth curves of synchronous and asynchronous evolutionary algorithms with populations structured according to a random ...
148
click to vote
AOSD
2007
ACM
15 years 8 months ago
2007
ACM
Inspired by our past manual aspect mining experiences, this paper describes a random walk model to approximate how crosscutting concerns can be discovered in the absence of domain...
156
click to vote
JSAC
2008
15 years 4 months ago
2008
Suppose we have a directed graph G with set of nodes V = {1, . . . , N} and a measure xi for every node i V . The average consensus problem consists in computing the average xA = ...