10988 search results - page 179 / 2198 » Algorithmic Folding Complexity |
131
Voted
CP
2008
Springer
15 years 5 months ago
2008
Springer
We introduce the SoftAllEqual global constraint, which maximizes the number of equalities holding between pairs of assignments to a set of variables. We study the computational com...
128
click to vote
PLANX
2008
15 years 5 months ago
2008
We investigate the complexity of earliest query answering for n-ary node selection queries defined by streaming tree automata (STAs). We elaborate an algorithm that selects query ...
143
Voted
UAI
2000
15 years 4 months ago
2000
We consider decentralized control of Markov decision processes and give complexity bounds on the worst-case running time for algorithms that find optimal solutions. Generalization...
157
Voted
TIP
2008
15 years 3 months ago
2008
This paper describes an approach to image modelling using interscale phase relationships of wavelet coefficients for use in image estimation applications. The method is based on th...
103
Voted
AAECC
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. Let C be an algebraic geometric code of dimension k and length n constructed on a curve X over Fq. Let s(C) be the state complexity of C and set w(C) := min{k, n-k}, the ...