1404 search results - page 201 / 281 » Complexity of admissible rules |
APPROX
2007
Springer
14 years 2 months ago
2007
Springer
Abstract. A fundamental goal of computational complexity (and foundations of cryptography) is to find a polynomial-time samplable distribution (e.g., the uniform distribution) and...
ICDCS
2005
IEEE
14 years 2 months ago
2005
IEEE
IT today is driven by the trend of increasing scale and complexity. Utility and Grid computing models, PlanetLab, and traditional data centers, are reaching the scale of thousands...
BMCBI
2008
13 years 9 months ago
2008
Background: It has been previously shown that palindromic sequences are frequently observed in proteins. However, our knowledge about their evolutionary origin and their possible ...
CHI
2006
ACM
14 years 9 months ago
2006
ACM
icians or philosophers use abstract symbols to derive formulas or form proofs. Indeed, these sketches are structural geometric proofs, consistent with Plato's supposition that...
SOSP
2005
ACM
14 years 5 months ago
2005
ACM
Overlay networks are used today in a variety of distributed systems ranging from file-sharing and storage systems to communication infrastructures. However, designing, building a...