4372 search results - page 13 / 875 » Algorithmic Theories of Everything |
INFOCOM
2009
IEEE
14 years 3 months ago
2009
IEEE
—During the past decade, the packet classification problem has been widely studied to accelerate network applications such as access control, traffic engineering and intrusion de...
SODA
2000
ACM
13 years 10 months ago
2000
ACM
We present a model that enables us to analyze the running time of an algorithm on a computer with a memory hierarchy with limited associativity, in terms of various cache parameter...
TSMC
2008
13 years 8 months ago
2008
The need to merge multiple sources of uncertain information is an important issue in many application areas, especially when there is potential for contradictions between sources. ...
SAGA
2007
Springer
14 years 2 months ago
2007
Springer
We consider applications of probabilistic techniques in the framework of algorithmic game theory. We focus on three distinct case studies: (i) The exploitation of the probabilistic...
WEA
2010
Springer
14 years 3 months ago
2010
Springer
We improve on earlier FPT algorithms for computing a rooted maximum agreement forest (MAF) or a maximum acyclic agreement forest (MAAF) of a pair of phylogenetic trees. Their sizes...