2412 search results - page 132 / 483 » Which Problems Have Strongly Exponential Complexity |
134
click to vote
COCOON
2009
Springer
15 years 10 months ago
2009
Springer
The problems of uniformly sampling and approximately counting contingency tables have been widely studied, but efficient solutions are only known in special cases. One appealing ap...
119
Voted
ICDCS
2007
IEEE
2007
IEEE
Exploiting Symbolic Techniques in Automated Synthesis of Distributed Programs with Large State Space
15 years 9 months ago
Automated formal analysis methods such as program verification and synthesis algorithms often suffer from time complexity of their decision procedures and also high space complex...
139
click to vote
INFOCOM
2006
IEEE
15 years 9 months ago
2006
IEEE
— This paper analyzes and designs medium access control (MAC) protocols for wireless ad-hoc networks through the network utility maximization (NUM) framework. We first reverse-e...
114
click to vote
CORR
2008
Springer
15 years 3 months ago
2008
Springer
Abstract. For Paradigm models, evolution is just-in-time specified coordination conducted by a special reusable component McPal. Evolution can be treated consistently and on-the-fl...
118
Voted
PODC
2009
ACM
16 years 3 months ago
2009
ACM
Peer-to-peer systems rely on scalable overlay networks that enable efficient routing between its members. Hypercubic topologies facilitate such operations while each node only nee...