9842 search results - page 235 / 1969 » The Complexity of the Matching-Cut Problem |
JAPLL
2006
13 years 10 months ago
2006
This paper presents a model checking algorithm for Propositional Dynamic Logic (PDL) with looping, repeat, test, intersection, converse, program complementation as well as context...
ADG
2000
Springer
14 years 3 months ago
2000
Springer
Abstract. Geometric straight-line programs [5, 8] can be used to model geometric constructions and their implicit ambiguities. In this paper we discuss the complexity of deciding w...
AMW
2010
14 years 7 days ago
2010
Based on practical observations on rule-based inference on RDF data, we study the problem of redundancy elimination in RDF in the presence of rules (in the form of Datalog rules) a...
IJCAI
1989
13 years 12 months ago
1989
We describe a general technique for expressing domain knowledge in constraint satisfaction problems, and using it to develop optimized parallel arc consistency algorithms for the ...
ICASSP
2011
IEEE
13 years 2 months ago
2011
IEEE
The fundamental problem of our interest is soft MIMO detection for the case of block fading, i.e., when the transmitted codeword spans over several independent channel realization...