6142 search results - page 876 / 1229 » The Complexity of Partition Functions |
178
click to vote
DEBU
2008
15 years 6 months ago
2008
Data-driven Web services, viewed broadly as interactive systems available on the Web for users and programs, provide the backbone for increasingly complex Web applications. While ...
155
click to vote
COMCOM
2006
15 years 6 months ago
2006
Quality of Service Routing is at present an active and remarkable research area, since most emerging network services require specialized Quality of Service (QoS) functionalities ...
191
click to vote
BMCBI
2007
15 years 6 months ago
2007
Background: Progressive advances in the measurement of complex multifactorial components of biological processes involving both spatial and temporal domains have made it difficult...
170
click to vote
BMCBI
2007
15 years 6 months ago
2007
Background: Cluster analysis has been widely applied for investigating structure in bio-molecular data. A drawback of most clustering algorithms is that they cannot automatically ...
179
click to vote
CC
2007
Springer
15 years 6 months ago
2007
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 ...