2661 search results - page 249 / 533 » Quantum Complexity Classes |
142
click to vote
CP
2005
Springer
15 years 6 months ago
2005
Springer
In this paper we present and evaluate an evolutionary approach for learning new constraint satisfaction algorithms, specifically for MAX-SAT optimisation problems. Our approach of...
128
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
In this paper we introduce a general framework for defining the depth of a sequence with respect to a class of observers. We show that our general framework captures all depth not...
142
click to vote
ADBIS
2010
Springer
15 years 5 months ago
2010
Springer
This paper presents a new method for image retrieval using a graph object oriented database for processing the information extracted from the image through the segmentation process...
118
click to vote
ACL
2006
15 years 5 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...
142
click to vote
DLOG
2006
15 years 5 months ago
2006
Tree automata are often used for satisfiability testing in the area of description logics, which usually yields ExpTime complexity results. We examine conditions under which this ...