3913 search results - page 283 / 783 » complexity 2006 |
149
click to vote
AAAI
2006
15 years 7 months ago
2006
The expected first hitting time is an important issue in theoretical analyses of evolutionary algorithms since it implies the average computational time complexity. In this paper,...
158
click to vote
ACL
2006
15 years 7 months ago
2006
Word alignment methods can gain valuable guidance by ensuring that their alignments maintain cohesion with respect to the phrases specified by a monolingual dependency tree. Howev...
137
click to vote
ACL
2006
15 years 7 months ago
2006
We present parsing algorithms for various mildly non-projective dependency formalisms. In particular, algorithms are presented for: all well-nested structures of gap degree at mos...
135
click to vote
AIPS
2006
15 years 7 months ago
2006
This paper presents an adaptation of the standard quantum search technique to enable application within Dynamic Programming, in order to optimise a Markov Decision Process. This i...
133
click to vote
DAGSTUHL
2006
15 years 7 months ago
2006
We consider the power of single level circuits in the context of graph complexity. We first prove that the single level conjecture fails for fanin-2 circuits over the basis {, , 1...