Sciweavers

514 search results - page 5 / 103
» Packet Classification Algorithms: From Theory to Practice
Sort
View
ICML
2010
IEEE
13 years 7 months ago
Efficient Selection of Multiple Bandit Arms: Theory and Practice
We consider the general, widely applicable problem of selecting from n real-valued random variables a subset of size m of those with the highest means, based on as few samples as ...
Shivaram Kalyanakrishnan, Peter Stone
RECOMB
2004
Springer
14 years 6 months ago
Reconstructing reticulate evolution in species: theory and practice
We present new methods for reconstructing reticulate evolution of species due to events such as horizontal transfer or hybrid speciation; both methods are based upon extensions of...
Luay Nakhleh, Tandy Warnow, C. Randal Linder
PODC
2003
ACM
13 years 11 months ago
Geometric ad-hoc routing: of theory and practice
All too often a seemingly insurmountable divide between theory and practice can be witnessed. In this paper we try to contribute to narrowing this gap in the field of ad-hoc rout...
Fabian Kuhn, Roger Wattenhofer, Yan Zhang, Aaron Z...
SIGMETRICS
2009
ACM
140views Hardware» more  SIGMETRICS 2009»
14 years 22 days ago
Maximum likelihood estimation of the flow size distribution tail index from sampled packet data
In the context of network traffic analysis, we address the problem of estimating the tail index of flow (or more generally of any group) size distribution from the observation of...
Patrick Loiseau, Paulo Gonçalves, Sté...
EC
1998
112views ECommerce» more  EC 1998»
13 years 5 months ago
DNA Computation: Theory, Practice, and Prospects
L. M. Adleman launched the field of DNA computing with a demonstration in 1994 that strands of DNA could be used to solve the Hamiltonian path problem for a simple graph. He also...
Carlo C. Maley