Results 11 to 20 of about 11,624,387 (363)
Truly stateless, optimal dynamic partial order reduction
Proc. ACM Program. Lang., 2022 Dynamic partial order reduction (DPOR) verifies concurrent programs by exploring all their interleavings up to some equivalence relation, such as the Mazurkiewicz trace equivalence. Doing so involves a complex trade-off between space and time.
Michalis Kokologiannakis +3 more
semanticscholar +1 more source
Partial-order-based process mining: a survey and outlook
Knowledge and Information Systems, 2022 The field of process mining focuses on distilling knowledge of the (historical) execution of a process based on the operational event data generated and stored during its execution.
S. Leemans, S. J. Zelst, Xixi Lu
semanticscholar +1 more source
Partial Order Pruning: For Best Speed/Accuracy Trade-Off in Neural Architecture Search [PDF]
Computer Vision and Pattern Recognition, 2019 Achieving good speed and accuracy trade-off on a target platform is very important in deploying deep neural networks in real world scenarios. However, most existing automatic architecture search approaches only concentrate on high performance.
X. Li +3 more
semanticscholar +1 more source
User’s guide to viscosity solutions of second order partial differential equations [PDF]
, 1992 The notion of viscosity solutions of scalar fully nonlinear partial differential equations of second order provides a framework in which startling comparison and uniqueness theorems, existence theorems, and theorems about continuous dependence may now be
M. Crandall, H. Ishii, P. Lions
semanticscholar +1 more source
abPOA: an SIMD-based C library for fast partial order alignment using adaptive band
bioRxiv, 2020 Summary Partial order alignment, which aligns a sequence to a directed acyclic graph, is now frequently used as a key component in long-read error correction and assembly.
Yan Gao +5 more
semanticscholar +1 more source
Optimising Partial-Order Plans Via Action Reinstantiation
International Joint Conference on Artificial Intelligence, 2020 This work investigates the problem of optimising a partial-order plan’s (POP) flexibility through the simultaneous transformation of its action ordering and variable binding constraints.
Marnix Suilen +3 more
semanticscholar +1 more source
Relaxing Time Windows by Partial Orders in Routing Problems With Stacking Constraints
IEEE Access, 2019 In vehicle routing problems, time windows are often used to formulate partial order relations between tasks in optimization model and related algorithm. However, time-window and partial order constraints are not equivalent.
Chen Wei, Zhi-Hua Hu, Wen-Wen Gao
doaj +1 more source
A Novel Method for Generating the M-Tri-Basis of an Ordered Γ-Semigroup
Mathematics, 2023 In this paper, we discuss the hypothesis that an ordered Γ-semigroup can be constructed on the M-left(right)-tri-basis. In order to generalize the left(right)-tri-basis using Γ-semigroups and ordered semigroups, we examined M-tri-ideals from a purely ...
M. Palanikumar +3 more
doaj +1 more source
Quasi-optimal partial order reduction [PDF]
Formal methods in system design, 2018 A dynamic partial order reduction (DPOR) algorithm is optimal when it always explores at most one representative per Mazurkiewicz trace. Existing literature suggests that the reduction obtained by the non-optimal, state-of-the-art Source-DPOR (SDPOR ...
Camille Coti +3 more
semanticscholar +1 more source
Convex (α, β)-Generalized Contraction and Its Applications in Matrix Equations
Axioms, 2023 This paper investigates the existence and convergence of solutions for linear and nonlinear matrix equations. This study explores the potential of convex (α,β)-generalized contraction mappings in geodesic spaces, ensuring the existence of solutions for ...
Rahul Shukla, Winter Sinkala
doaj +1 more source