نتایج جستجو برای: forward solver
تعداد نتایج: 137936 فیلتر نتایج به سال:
Propositional satisfiability (SAT) is an NP-complete problem, holding a central place in computer science and engineering. SAT has numerous applications in formal verification, artificial intelligence and other areas. Modern SAT solvers, using an enhanced version of the backtrack search DavisLogemann-Loveland (DLL) algorithm, are able to successfully cope with instances comprising millions of v...
Adaptivity in both space and time has become the norm for solving problems modeled by partial differential equations. The size of the discretized problem makes uniformly refined grids computationally prohibitive. Adaptive refinement of meshes and time steps allows to capture the phenomena of interest while keeping the cost of a simulation tractable on the current hardware. Many fields in scienc...
This paper presents a new geometric algorithm to efficiently compute the analytical differentiation of Articulated-body Algorithm (ABA) with respect state variables. Despite fact that ABA solves forward-dynamics problem in linear time for branched-multibody systems, its explicit is not straightforward, and computationally demanding tensor products contractions appear. The proposed makes use Lie...
This paper compares the performance of two graph neural network architectures on emulation a cardiac mechanic model left ventricle heart. These models can be applied directly same computational mesh geometry that is used by expensive numerical forward solver, precluding need for low-order approximation true geometry. Our results show these approaches incur negligible loss in accuracy compared s...
Inaccurate description of the equilibrium can yield to spurious effects in gyrokinetic turbulence simulations. Also, the Vlasov solver and time integration schemes impact the conservation of physical quantities, especially in long-term simulations. Equilibrium and Vlasov solver have to be tuned in order to preserve constant states (equilibrium) and to provide good conservation property along ti...
Abstract The logical framework of Constrained Horn Clauses (CHC) models verification tasks from a variety domains, ranging safety properties in transition systems to modular programs with procedures. In this work we present Golem , flexible and efficient solver for satisfiability CHC over linear real integer arithmetic. provides flexibility architecture multiple back-end model-checking algorith...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید