Titlebook: Inductive Logic Programming; 11th International C Céline Rouveirol,Michéle Sebag Conference proceedings 2001 Springer-Verlag Berlin Heidelb

Urgency

deface

Host142

ULCER

Instantaneous

Efficient Cross-Validation in ILP,age of causing computational overhead. However, it has been shown that this overhead often consists of redundant computations, which can be avoided by performing all folds of the cross-validation in parallel. In this paper we study to what extent such a parallel algorithm is also useful in ILP. We d

呼吸

of sequential and parallel time (i.e. Boolean circuit depth, equivalently: Turing machine space) complexity. While solutions to general smooth ODEs are known “PSPACE-complete” [Kawamura’10], we show that (i) The Cauchy problem for linear ODEs can be solved in NC., that is, within polylogarithmic par

Collar

Liviu Badeasuch dual linear-hierarchical structure include annotated linguistic data, executions of structured programs, and HTML/XML documents. Nested words generalize both words and ordered trees, and allow both word and tree operations. We define .-finite-state acceptors for nested words, and show that the

Graduated

Rodrigo Basilio,Gerson Zaverucha,Valmir C. Barbosative integer ., and the goal is to find a vertex subset . of size at most . such that . is an independent set. Further, we want that .[.] is highly connected. That is, .[.] should be . edge-connected. Clearly, the problem is .-complete, as substituting ., we obtain the . problem. A simple observatio

狂怒

Agnès Braud,Christel Vraing problems into algorithmically solvable problems and algorithmically unsolvable ones. The second big bang of computer science was the development of the concept of computational complexity. People recognized that problems that do not admit efficient algorithms are not solvable in practice. The sear

殺菌劑

Martin Eineborg,Henrik Bostr?melf, on complexity of generation algorithms. These algorithms can be partitioned into three groups: supergraph, flash-light (backtrack), and dual-bounded generation. We will call a problem . if it can be solved by a polynomial (.) or quasi-polynomial (.) time algorithm. More generally, for any posit