983 search results - page 117 / 197 » Circuit Complexity and Multiplicative Complexity of Boolean ... |
WECWIS
2008
IEEE
14 years 4 months ago
2008
IEEE
Today’s development and provision of commercially used Web services has shifted from providing static and predefined functionality to highly configurable services that can be ...
WECWIS
2003
IEEE
14 years 3 months ago
2003
IEEE
Agent negotiation over multiple issues is often seen as the process of searching for a solution in a complex and large space. Depending on the negotiation mechanism such search sp...
CORR
2002
Springer
13 years 10 months ago
2002
Springer
An algorithm M is described that solves any well-defined problem p as quickly as the fastest algorithm computing a solution to p, save for a factor of 5 and loworder additive term...
FOCS
1999
IEEE
14 years 2 months ago
1999
IEEE
Various efforts ([?, ?, ?]) have been made in recent years to derandomize probabilistic algorithms using the complexity theoretic assumption that there exists a problem in E = dti...
BMCBI
2011
13 years 4 months ago
2011
Background: The Monte Carlo simulation of sequence evolution is routinely used to assess the performance of phylogenetic inference methods and sequence alignment algorithms. Progr...