Sciweavers

4894 search results - page 391 / 979
» Choices
Sort
View
CN
2006
106views more  CN 2006»
15 years 7 months ago
Efficient large-scale BGP simulations
Simulation has been the method of choice for analyzing large, complex, and highly volatile systems. One of these systems is the inter-domain routing infrastructure of the Internet...
Xenofontas A. Dimitropoulos, George F. Riley
CORR
2006
Springer
121views Education» more  CORR 2006»
15 years 7 months ago
On the Foundations of Universal Sequence Prediction
Solomonoff completed the Bayesian framework by providing a rigorous, unique, formal, and universal choice for the model class and the prior. We discuss in breadth how and in which...
Marcus Hutter
CPC
2006
84views more  CPC 2006»
15 years 7 months ago
Splitter Theorems for Cubic Graphs
Let ;k g be the class of k-connected cubic graphs of girth at least g. For several choices of k and g, we determine a set Ok g of graph operations, for which, if G and H are graph...
Guoli Ding, Jinko Kanno
CPC
2006
93views more  CPC 2006»
15 years 7 months ago
Generating Outerplanar Graphs Uniformly at Random
We show how to generate labeled and unlabeled outerplanar graphs with n vertices uniformly at random in polynomial time in n. To generate labeled outerplanar graphs, we present a c...
Manuel Bodirsky, Mihyun Kang
CSDA
2006
107views more  CSDA 2006»
15 years 7 months ago
Optimal confidence interval for the largest normal mean under heteroscedasticity
A two-stage sampling procedure for obtaining an optimal confidence interval for the largest or smallest mean of k independent normal populations is proposed, where the population ...
Hubert J. Chen, Miin-Jye Wen