10988 search results - page 450 / 2198 » Algorithmic Folding Complexity |
202
click to vote
IWOCA
2010
Springer
15 years 1 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 ...
241
click to vote
ISMIS
2011
Springer
14 years 9 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...
149
click to vote
DAC
2003
ACM
16 years 7 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...
210
click to vote
DAC
2004
ACM
16 years 7 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...
283
click to vote
ECOWS
2009
Springer
16 years 28 days ago
2009
Springer
Abstract—In this paper, we address the problem of selfadaptation in internet-scale service-oriented systems. Services need to adapt by select the best neighboring services solely...