10988 search results - page 401 / 2198 » Algorithmic Folding Complexity |
128
Voted
STACS
2005
Springer
15 years 10 months ago
2005
Springer
We define and study the complexity of robust polynomials for Boolean functions and the related fault-tolerant quantum decision trees, where input bits are perturbed by noise. We ...
127
click to vote
GREC
2007
Springer
15 years 9 months ago
2007
Springer
In this paper a genetic matching scheme is extended to take into account primitive arcs and complex description in the pattern recognition process. Classical ways only focus on seg...
140
Voted
ISPE
2003
15 years 6 months ago
2003
: Work to date on computational models of negotiation has focused almost exclusively on defining agreements consisting of one or a few independent issues. The negotiation involved ...
140
click to vote
APWEB
2010
Springer
15 years 5 months ago
2010
Springer
SimRank has been proposed to rank web documents based on a graph model on hyperlinks. The existing techniques for conducting SimRank computation adopt an iteration computation para...
140
click to vote
EUROPAR
2010
Springer
15 years 5 months ago
2010
Springer
Abstract. In this paper we consider the problem of scheduling on computing platforms composed of several independent organizations, known as the Multi-Organization Scheduling Probl...