10608 search results - page 369 / 2122 » Complexity of O'Hara's Algorithm |
RSA
2010
14 years 11 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 ...
122
Voted
IWOCA
2010
Springer
14 years 7 months ago
2010
Springer
The maximum independent set problem is NP-complete for graphs in general, but becomes solvable in polynomial time when restricted to graphs in many special classes. The problem is ...
168
click to vote
ISMIS
2011
Springer
14 years 3 months ago
2011
Springer
In the paper we present a new evolutionary algorithm for induction of regression trees. In contrast to the typical top-down approaches it globally searches for the best tree struct...
86
Voted
DAC
2003
ACM
16 years 1 months ago
2003
ACM
Structuring and mapping of a Boolean function is an important problem in the design of complex integrated circuits. Libraryaware constructive decomposition offers a solution to th...
140
Voted
DAC
2004
ACM
16 years 1 months ago
2004
ACM
Reversible logic has applications in many fields, including quantum computing. Synthesis techniques for reversible circuits are not well developed, even for functions with a small...