2638 search results - page 222 / 528 » Random Geometric Complexes |
177
click to vote
NIPS
2004
15 years 8 months ago
2004
Go is an ancient oriental game whose complexity has defeated attempts to automate it. We suggest using probability in a Bayesian sense to model the uncertainty arising from the va...
162
click to vote
WSC
2001
15 years 8 months ago
2001
Congestion control algorithms, such as TCP or the closelyrelated additive increase-multiplicative decrease algorithms, are extremely difficult to simulate on a large scale. The re...
191
click to vote
IM
2007
15 years 6 months ago
2007
Abstract. The web may be viewed as a graph each of whose vertices corresponds to a static HTML web page, and each of whose edges corresponds to a hyperlink from one web page to ano...
175
click to vote
WIOPT
2010
IEEE
15 years 5 months ago
2010
IEEE
—It has been shown that the well-known cutset bounds can be achieved for deterministic wireless networks by performing random coding at each intermediate node. The complexity and...
159
click to vote
BMCBI
2007
15 years 6 months ago
2007
Background: Docking algorithms are developed to predict in which orientation two proteins are likely to bind under natural conditions. The currently used methods usually consist o...