1542 search results - page 96 / 309 » The metamathematics of random graphs |
148
Voted
ANTSW
2010
Springer
14 years 11 months ago
2010
Springer
Ant colony optimization (ACO) has been widely used for different combinatorial optimization problems. In this paper, we investigate ACO algorithms with respect to their runtime beh...
122
Voted
JSAC
2007
15 years 1 months ago
2007
— In information theory, it has been shown that network coding can effectively improve the throughput of multicast communication sessions in directed acyclic graphs. More practic...
146
click to vote
MICCAI
2010
Springer
15 years 5 days ago
2010
Springer
Segmentation is a fundamental problem in medical image analysis. The use of prior knowledge is often considered to address the ill-posedness of the process. Such a process consists...
96
Voted
SIGCOMM
2009
ACM
15 years 8 months ago
2009
ACM
We describe a new model for studying intermittently connected mobile networks, based on Markovian random temporal graphs, that captures the influence of message size, maximum tol...
113
click to vote
FOCS
2009
IEEE
15 years 8 months ago
2009
IEEE
In this paper, we set forth a new algorithm for generating approximately uniformly random spanning trees in undirected graphs. We show how to sample from a distribution that is wi...