3758 search results - page 440 / 752 » A Complete Subsumption Algorithm |
190
click to vote
INFOCOM
2005
IEEE
16 years 12 days ago
2005
IEEE
— In this paper we consider packet networks loaded by admissible traffic patterns, i.e. by traffic patterns that, if optimally routed, do not overload network resources. In the...
193
click to vote
COCO
2005
Springer
16 years 10 days ago
2005
Springer
We prove that if NP ⊆ BPP, i.e., if SAT is worst-case hard, then for every probabilistic polynomial-time algorithm trying to decide SAT, there exists some polynomially samplable ...
199
click to vote
IPCO
2007
15 years 8 months ago
2007
Following the well-studied two-stage optimization framework for stochastic optimization [15, 18], we study approximation algorithms for robust two-stage optimization problems with ...
139
click to vote
BMCBI
2007
15 years 7 months ago
2007
Background: The main two sorts of automatic gene annotation frameworks are ab initio and alignment-based, the latter splitting into two sub-groups. The first group is used for int...
194
click to vote
BMCBI
2007
15 years 6 months ago
2007
Background: Computational methods to predict transcription factor binding sites (TFBS) based on exhaustive algorithms are guaranteed to find the best patterns but are often limite...