Sciweavers

1763 search results - page 241 / 353
» Dependent random choice
Sort
View
CPHYSICS
2007
222views more  CPHYSICS 2007»
13 years 8 months ago
JADAMILU: a software code for computing selected eigenvalues of large sparse symmetric matrices
A new software code for computing selected eigenvalues and associated eigenvectors of a real symmetric matrix is described. The eigenvalues are either the smallest or those closes...
Matthias Bollhöfer, Yvan Notay
JACM
2006
93views more  JACM 2006»
13 years 8 months ago
Combining expert advice in reactive environments
"Experts algorithms" constitute a methodology for choosing actions repeatedly, when the rewards depend both on the choice of action and on the unknown current state of t...
Daniela Pucci de Farias, Nimrod Megiddo
BMCBI
2005
87views more  BMCBI 2005»
13 years 8 months ago
ProfNet, a method to derive profile-profile alignment scoring functions that improves the alignments of distantly related protei
Background: Profile-profile methods have been used for some years now to detect and align homologous proteins. The best such methods use information from the background distributi...
Tomas Ohlson, Arne Elofsson
MOC
2002
118views more  MOC 2002»
13 years 7 months ago
The error bounds and tractability of quasi-Monte Carlo algorithms in infinite dimension
Dimensionally unbounded problems are frequently encountered in practice, such as in simulations of stochastic processes, in particle and light transport problems and in the problem...
Fred J. Hickernell, Xiaoqun Wang
JSAC
2010
131views more  JSAC 2010»
13 years 6 months ago
BGP Add-Paths: The Scaling/Performance Tradeoffs
— Internet Service Providers design their network with resiliency in mind, having multiple paths towards external IP subnets available at the borders of their network. However, w...
Virginie Van den Schrieck, Pierre François,...