作者: Exterior 時間: 2025-3-21 23:49 作者: ITCH 時間: 2025-3-22 04:18
Efficient Cross-Validation in ILP,iscuss two issues: a) the existence of dependencies between parts of a query that limit the obtainable efficiency improvements and b) the combination of parallel cross-validation with query-packs. Tentative solutions are proposed and evaluated experimentally.作者: 有其法作用 時間: 2025-3-22 07:50
A Genetic Algorithm for Propositionalization, individual, and general set-based operators to alter one partition or to mix two ones. For propositionalization, operators are extended to change not only the partition but also the associated numeric constraints.作者: 沙草紙 時間: 2025-3-22 09:23 作者: 寬容 時間: 2025-3-22 13:24 作者: Intellectual 時間: 2025-3-22 19:25 作者: 使聲音降低 時間: 2025-3-23 00:55 作者: Acetaminophen 時間: 2025-3-23 01:45 作者: lanugo 時間: 2025-3-23 07:47
Towards Combining Inductive Logic Programming with Bayesian Networks,ponents of Bayesian logic programs. More precisely, we show how to combine the ILP setting . with score-based techniques for learning Bayesian networks. Thus, the paper positively answers Koller and Pfeffer’s question, whether techniques from ILP could help to learn the logical component of first order probabilistic models.作者: enterprise 時間: 2025-3-23 16:10
A Refinement Operator for Theories, due to the commutativity of refinement operations while preserving weak completeness as well as a limited form of flexibility. The refinement operator presented in this paper represents a first step towards constructing more efficient and . ILP systems with precise theoretical guarantees.作者: 社團 時間: 2025-3-23 21:34 作者: Glucose 時間: 2025-3-24 01:33
Discovering Associations between Spatial Objects: An ILP Application,atial objects. It operates on a deductive relational database set up by selecting and transforming data stored in the underlying spatial database. Preliminary experimental results have been obtained by running SPADA on geo-referenced census data of Manchester Stockport, UK.作者: 噴出 時間: 2025-3-24 04:51
-Subsumption in a Constraint Satisfaction Perspective, this region has been shown of utmost relevance to ILP [.]. Experiments on artificial .-subsumption problems designed to illustrate the phase transition phenomenon, show that . is faster by several orders of magnitude than previous .-subsumption algorithms, within and outside the PT region.作者: 方舟 時間: 2025-3-24 08:24
ss .: improving over common numerical approaches yielding exponential sequential time or parallel polynomial time. Our results build on efficient algorithms and their analyses for real polynomial, matrix and operator powering which do not occur in the discrete case and may be of independent interest作者: 惡意 時間: 2025-3-24 12:41 作者: nerve-sparing 時間: 2025-3-24 17:45
Rodrigo Basilio,Gerson Zaverucha,Valmir C. Barbosaunning time ., that is, they are . with the parameter .. One of our main subroutines to obtain these algorithms is an . algorithm for . edge connected ., which could be of an independent interest. Finally, we also show that such an algorithm is not possible for ..作者: Forsake 時間: 2025-3-24 22:16
Agnès Braud,Christel Vrainractically solvable problems and the practically unsolvable ones partially reminds of the never-ending search for the definition of “l(fā)ife” in biology or for the definitions of matter and energy in physics. Can the search for the formal notion of “practical solvability” also become a never-ending sto作者: 詞根詞綴法 時間: 2025-3-25 03:00
Martin Eineborg,Henrik Bostr?me, we show that generating all vertices of a polyhedron, given by its facets, is NP-complete (while the complexity status is still open in case of the polytopes, that is, bounded polyhedra). This problem is reduced to generating all negative cycles of a weighted digraph, which is NP-complete (for gr作者: 小故事 時間: 2025-3-25 03:39 作者: Baffle 時間: 2025-3-25 10:51
Katsumi Inouewith nonlinear . and random .. All above lower bounds are randomized..The main contribution of this paper is the simpler proof of the exponential lower bound of the Goldreich’s function inversion by myopic DPLL algorithms. A dependency graph in our construction may be based on an arbitrary expander,作者: 熟練 時間: 2025-3-25 12:38
Nico Jacobs,Hendrik Blockeelically restricted first-order logic, and another characterization in terms of a finite set of relations . that allow primitive positive definitions of all other relations in the class. We also present a subclass of max-closed constraints where the CSP is in .; this class generalizes the class of max作者: Insatiable 時間: 2025-3-25 19:50 作者: 向下五度才偏 時間: 2025-3-25 21:26
Kristian Kersting,Luc De Raedtally, we prove the width hierarchy for complexity classes of Boolean functions for bounded error probabilistic OBDDs. And using “reordering” method we extend a hierarchy for .-OBDD of polynomial size, for .. Moreover, we proved a similar hierarchy for bounded error probabilistic .-OBDD. And for dete作者: 時代 時間: 2025-3-26 01:52 作者: habile 時間: 2025-3-26 07:25 作者: Rotator-Cuff 時間: 2025-3-26 10:06
Donato Malerba,Francesca A. Lisilization techniques to provide meaningful and comparable results from the deployment of scalable solutions, demonstrating their benefits and drawbacks. Towards this direction, we present a use case for deploying cybersecurity exercises that requires less effort and moderate system resources. By usin作者: DENT 時間: 2025-3-26 13:06 作者: 勉勵 時間: 2025-3-26 17:23
Miloslav Nepillization techniques to provide meaningful and comparable results from the deployment of scalable solutions, demonstrating their benefits and drawbacks. Towards this direction, we present a use case for deploying cybersecurity exercises that requires less effort and moderate system resources. By usin作者: Certainty 時間: 2025-3-26 23:06 作者: goodwill 時間: 2025-3-27 04:14 作者: creatine-kinase 時間: 2025-3-27 09:05
Jan Struyf,Hendrik Blockeelure addresses the conditions required for offering effective cyber insurance for interoperable service chains cutting across application domains and jurisdictions. CyberSure platform aims to tackle the challenges of offering cyber insurance for interoperable service chains cutting across application作者: Tailor 時間: 2025-3-27 12:29 作者: 收到 時間: 2025-3-27 16:53
Application of Pruning Techniques for Propositional Learning to Progol,ess of the proposed algorithms. The results show that the proposed algorithms reduce the number of candidate hypotheses to be evaluated as well as the computational time for a certain class of problems.作者: 地牢 時間: 2025-3-27 18:27
René Quiniou,Marie-Odile Cordier,Guy Carrault,Feng Wang secure software development, malicious code analysis as well as security testing platforms. . From the MSTEC Workshop 7 full papers out of 15 submissions are i978-3-030-42050-5978-3-030-42051-2Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 滔滔不絕地說 時間: 2025-3-28 01:25 作者: 深淵 時間: 2025-3-28 05:54 作者: 多山 時間: 2025-3-28 09:31 作者: Measured 時間: 2025-3-28 11:29
Classifying Uncovered Examples by Rule Stretching,lass to the uncovered examples, which is the standard method, a novel method is presented that minimally generalises the rules to include the uncovered examples. The new method, called Rule Stretching, has been evaluated on several domains (using the inductive logic programming system Virtual Predic作者: 扔掉掐死你 時間: 2025-3-28 17:33 作者: 證實 時間: 2025-3-28 20:53 作者: giggle 時間: 2025-3-28 23:34 作者: Presbycusis 時間: 2025-3-29 06:44
An Automated ILP Server in the Field of Bioinformatics,based method, . (HI), which acts as a filter for existing sequence similarity searches to improve their performance in the detection of remote protein homologies. HI performs a PSI-BLAST search to generate positive, negative, and uncertain examples, and collects descriptions of these examples. It th作者: Obstreperous 時間: 2025-3-29 08:26 作者: 使困惑 時間: 2025-3-29 14:41
Towards Combining Inductive Logic Programming with Bayesian Networks, these languages. In this paper, we present results on combining . (ILP) with Bayesian networks to learn both the qualitative and the quantitative components of Bayesian logic programs. More precisely, we show how to combine the ILP setting . with score-based techniques for learning Bayesian network作者: 表示問 時間: 2025-3-29 16:07
Demand-Driven Construction of Structural Features in ILP,ther unspecific way. That is, they do not construct features “on demand”, but rather in advance and without detecting the need for a representation change. Even if structural features are required, current methods do not construct these features in a goal-directed fashion..In previous work, we prese作者: ONYM 時間: 2025-3-29 22:18 作者: BLINK 時間: 2025-3-30 01:16 作者: ADORE 時間: 2025-3-30 06:50 作者: Urgency 時間: 2025-3-30 09:34 作者: deface 時間: 2025-3-30 16:04 作者: Host142 時間: 2025-3-30 17:40 作者: ULCER 時間: 2025-3-30 22:09 作者: Instantaneous 時間: 2025-3-31 01:54
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作者: 呼吸 時間: 2025-3-31 09:03
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 時間: 2025-3-31 09:38
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 時間: 2025-3-31 16:42
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作者: 狂怒 時間: 2025-3-31 19:14
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作者: 殺菌劑 時間: 2025-3-31 23:15
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作者: 流利圓滑 時間: 2025-4-1 02:17
Susanne Hoche,Stefan Wrobelhe . problem we need to increase the edge-connectivity by?1. In the . problem . is connected and . should be 2-connected. In . problems every edge in . connects minimal deficient sets. For this version we give a simple combinatorial approximation algorithm with ratio 5/3, improving the 1.91 approxim作者: Irrepressible 時間: 2025-4-1 06:08 作者: 杠桿 時間: 2025-4-1 10:29
Nico Jacobs,Hendrik Blockeelstraints is at least as hard as determining the winner in Mean Payoff Games, a notorious problem of open computational complexity. Mean Payoff Games are known to be in?., which is not known for max-closed semilinear constraints. Semilinear relations that are max-closed and additionally closed under 作者: brachial-plexus 時間: 2025-4-1 17:57 作者: 鋼筆尖 時間: 2025-4-1 21:47 作者: Unsaturated-Fat 時間: 2025-4-2 02:28 作者: AMEND 時間: 2025-4-2 05:21
Mark-A. Krogel,Stefan Wrobel of requirements and trade-offs between conflicting requirements. While there have been some general-purpose digital watermarking benchmarking systems available, they normally do not support complicated benchmarking tasks and cannot be easily reconfigured to work with different watermarking algorith
