9842 search results - page 454 / 1969 » The Complexity of the Matching-Cut Problem |
205
Voted
ACL
1990
15 years 8 months ago
1990
We present a new grammatical formalism called Constraint Dependency Grammar (CDG) in which every grammatical rule is given as a constraint on wordto-word modifications. CDG parsin...
191
click to vote
IJCAI
1989
15 years 8 months ago
1989
Each concept description language and search strategy has an inherent inductive bias, a preference for some hypotheses over others. No single inductive bias performs optimally on ...
170
click to vote
CEC
2010
IEEE
15 years 8 months ago
2010
IEEE
Abstract-- This paper presents a fast and reliable globalsearch approach to the problem of virtual camera positioning when multiple objects that need to be within the reach of the ...
199
click to vote
CSL
2010
Springer
15 years 8 months ago
2010
Springer
We introduce two-sorted theories in the style of [CN10] for the complexity classes L and DET, whose complete problems include determinants over Z2 and Z, respectively. We then desc...
168
click to vote
AIEDU
2006
15 years 7 months ago
2006
Tutoring systems are described as having two loops. The outer loop executes once for each task, where a task usually consists of solving a complex, multi-step problem. The inner lo...