9842 search results - page 111 / 1969 » The Complexity of the Matching-Cut Problem |
IAT
2008
IEEE
13 years 10 months ago
2008
IEEE
TD-FALCON (Temporal Difference - Fusion Architecture for Learning, COgnition, and Navigation) is a class of self-organizing neural networks that incorporates Temporal Difference (...
CORR
2007
Springer
13 years 10 months ago
2007
Springer
We survey results in algebraic complexity theory, focusing on matrix multiplication. Our goals are (i.) to show how open questions in algebraic complexity theory are naturally pose...
IJCAI
2003
13 years 11 months ago
2003
Disjunctive Logic Programming (DLP) is a very expressive formalism: it allows to express every property of finite structures that is decidable in the complexity class ¡£¢¤ (...
MST
2007
13 years 9 months ago
2007
Important variants of the Vertex Cover problem (among others, Connected Vertex Cover, Capacitated Vertex Cover, and Maximum Partial Vertex Cover) have been intensively studied in ...
SAC
2008
ACM
13 years 9 months ago
2008
ACM
We consider analysis of complex stochastic models based upon partial information. MCMC and reversible jump MCMC are often the methods of choice for such problems, but in some situ...