Search Results - "Algorithm"

Refine Results
  1. 7221

    Machine Learning and Its Application to Reacting Flows ML and Combustion /

    Published 2023
    Table of Contents: “…Introduction -- ML Algorithms, Techniques and their Application to Reactive Molecular Dynamics Simulations -- Big Data Analysis, Analytics & ML role -- ML for SGS Turbulence (including scalar flux) Closures -- ML for Combustion Chemistry -- Applying CNNs to model SGS flame wrinkling in thickened flame LES (TFLES) -- Machine Learning Strategy for Subgrid Modelling of Turbulent Combustion using Linear Eddy Mixing based Tabulation -- MILD Combustion-Joint SGS FDF -- Machine Learning for Principal Component Analysis & Transport -- Super Resolution Neural Network for Turbulent non-premixed Combustion -- ML in Thermoacoustics -- Concluding Remarks & Outlook.…”
    Link to Metadata
    Electronic eBook
  2. 7222

    Automated Deduction - CADE 29 29th International Conference on Automated Deduction, Rome, Italy, July 1-4, 2023, Proceedings /

    Published 2023
    Table of Contents: “…Certified Core-Guided MaxSAT Solving -- Superposition with Delayed Unification -- On Incremental Pre-processing for SMT -- Verified Given Clause Procedures -- QSMA: A New Algorithm for Quantified Satisfiability Modulo Theory and Assignment -- Uniform Substitution for Dynamic Logic with Communicating Hybrid Programs -- An Isabelle/HOL Formalization of the SCL(FOL) Calculus -- SCL(FOL) Can Simulate Non-Redundant Superposition Clause Learning -- Formal Reasoning about Influence in Natural Sciences Experiments -- A Theory of Cartesian Arrays (with Applications in Quantum Circuit Verification) -- SAT-Based Subsumption Resolution -- A more Pragmatic CDCL for IsaSAT and targetting LLVM (Short Paper) -- Proving Non-Termination by Acceleration Driven Clause Learning (Short Paper) -- COOL 2 - A Generic Reasoner for Modal Fixpoint Logics (System Description) -- Choose your Colour: Tree Interpolation for Quantified Formulas in SMT -- Proving Termination of C Programs with Lists -- Reasoning about Regular Properties: A Comparative Study -- Program Synthesis in Saturation -- A Uniform Formalisation of Three-Valued Logics in Bisequent Calculus -- Proving Almost-Sure Innermost Termination of Probabilistic Term Rewriting Using Dependency Pairs -- Verification of NP-hardness Reduction Functions for Exact Lattice Problems -- Buy One Get 14 Free: Evaluating Local Reductions for Modal Logic -- Left-Linear Completion with AC Axioms -- On P -interpolation in local theory extensions and applications to the study of interpolation in the description logics EL, EL+ -- Theorem Proving in Dependently-Typed Higher-Order Logic -- Towards Fast Nominal Anti-Unification of Letrec-Expressions -- Confluence Criteria for Logically Constrained Rewrite Systems -- Towards a Verified Tableau Prover for a Quantifier-Free Fragment of Set Theory -- An Experimental Pipeline for Automated Reasoning in Natural Language (Short paper) -- Combining Combination Properties: An Analysis of Stable-infiniteness, Convexity, and Politeness -- Decidability of difference logic over the reals with uninterpreted unary predicates -- Incremental Rewriting Modulo SMT -- Iscalc: an Interactive Symbolic Computation Framework (System Description).…”
    Link to Metadata
    Electronic eBook
  3. 7223
  4. 7224
  5. 7225
  6. 7226
  7. 7227

    Can We Trust AI? by Chellappa, Rama

    Published 2022
    DOAB: download the publication
    DOAB: description of the publication
    Electronic Book Chapter
  8. 7228
  9. 7229
  10. 7230
  11. 7231
  12. 7232
  13. 7233
  14. 7234
  15. 7235
  16. 7236
  17. 7237
  18. 7238
  19. 7239
  20. 7240