15033 search results - page 90 / 3007 » Complexity Theory and Algorithms |
139
Voted
INFOCOM
2009
IEEE
15 years 10 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...
140
Voted
TSMC
2008
15 years 3 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. ...
160
Voted
SAGA
2007
Springer
15 years 9 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...
129
click to vote
ENTCS
2011
14 years 10 months ago
2011
We preliminarily recap what is meant by complexity and non-Turing computation, by way of explanation of our title, ‘Computational Complexity in Non-Turing Models of Computationâ...
158
Voted
WEA
2010
Springer
15 years 10 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...