2168 search results - page 149 / 434 » Randomized Algorithms and Complexity Theory |
108
Voted
RSA
2010
15 years 1 months ago
2010
Abstract. We present a randomized approximation algorithm for counting contingency tables, m × n non-negative integer matrices with given row sums R = (r1, . . . , rm) and column ...
142
Voted
ATAL
2006
Springer
15 years 7 months ago
2006
Springer
We investigate the computational complexity of reasoning about multi-agent systems using the cooperation logic ATL of Alur, Henzinger, and Kupferman. It is known that satisfiabili...
108
Voted
NIPS
1998
15 years 4 months ago
1998
Principal curves have been defined as "self consistent" smooth curves which pass through the "middle" of a d-dimensional probability distribution or data cloud...
138
Voted
UAI
2004
15 years 4 months ago
2004
In this paper, we present a Branch and Bound algorithm called QuickBB for computing the treewidth of an undirected graph. This algorithm performs a search in the space of perfect ...
121
Voted
SODA
2010
ACM
16 years 24 days ago
2010
ACM
We study the computational complexity of some central analysis problems for One-Counter Markov Decision Processes (OC-MDPs), a class of finitely-presented, countable-state MDPs. O...