9842 search results - page 1353 / 1969 » Problem complexity |
197
click to vote
CCGRID
2001
IEEE
15 years 11 months ago
2001
IEEE
The Differentiated Services (DiffServ) approach will also bring benefits for multicast applications which need quality of service support. For instance, a highly reliable multicas...
208
click to vote
COMPGEOM
2005
ACM
15 years 9 months ago
2005
ACM
Let S be a set of n points moving on the real line. The kinetic sorting problem is to maintain a data structure on the set S that makes it possible to quickly generate a sorted li...
177
click to vote
BMCBI
2008
15 years 7 months ago
2008
Background: This article provides guidelines for selecting optimal numerical solvers for biomolecular system models. Because various parameters of the same system could have drast...
229
click to vote
WABI
2010
Springer
15 years 5 months ago
2010
Springer
Background: Although many RNA molecules contain pseudoknots, computational prediction of pseudoknotted RNA structure is still in its infancy due to high running time and space con...
199
click to vote
CORR
2011
Springer
15 years 2 months ago
2011
Springer
In this paper, we study the average case complexity of the Unique Games problem. We propose a natural semi-random model, in which a unique game instance is generated in several st...