Results 141 to 150 of about 720,598 (345)
Constructing (Bi)Similar Finite State Abstractions using Asynchronous $l$-Complete Approximations
This paper constructs a finite state abstraction of a possibly continuous-time and infinite state model in two steps. First, a finite external signal space is added, generating a so called $\Phi$-dynamical system. Secondly, the strongest asynchronous $l$-
Raisch, Jörg, Schmuck, Anne-Kathrin
core +1 more source
Inviwo -- A Visualization System with Usage Abstraction Levels
The complexity of today's visualization applications demands specific visualization systems tailored for the development of these applications. Frequently, such systems utilize levels of abstraction to improve the application development process, for ...
Englund, Rickard+8 more
core +1 more source
Abstract Convexity and Cone-Vexing Abstractions [PDF]
This talk is a write-up on some origins of abstract convexity and afew vexing limitations on the range of abstraction in convexity.
arxiv
A Critical Look at the Abstraction Based on Macro-Operators [PDF]
ion can be an effective technique for dealing with the complexity of planning tasks. This paper is aimed at assessing and identifying in which cases abstraction can actually speed-up the overall search.
ARMANO G, CHERCHI G, VARGIU E
core
Expressiveness and Completeness in Abstraction
We study two notions of expressiveness, which have appeared in abstraction theory for model checking, and find them incomparable in general. In particular, we show that according to the most widely used notion, the class of Kripke Modal Transition ...
Bas Luttik+22 more
core +3 more sources
HYDROGEN ABSTRACTION REACTIONS OF DIPHENYLPICRYLHYDRAZYL [PDF]
A. G. Brook+2 more
openalex +1 more source
Graph Abstraction and Abstract Graph Transformation [PDF]
Many important systems like concurrent heap-manipulating programs, communication networks, or distributed algorithms are hard to verify due to their inherent dynamics and unboundedness.
Bauer, J.+3 more
core +1 more source
Imperfect-Recall Abstractions with Bounds in Games
Imperfect-recall abstraction has emerged as the leading paradigm for practical large-scale equilibrium computation in incomplete-information games. However, imperfect-recall abstractions are poorly understood, and only weak algorithm-specific guarantees ...
Kroer, Christian, Sandholm, Tuomas
core +1 more source
Weak morphisms of higher dimensional automata [PDF]
We introduce weak morphisms of higher dimensional automata and use them to define preorder relations for HDAs, among which homeomorphic abstraction and trace equivalent abstraction. It is shown that homeomorphic abstraction is essentially always stronger than trace equivalent abstraction. We also define the trace language of an HDA and show that, for a
arxiv
Hydrogen Abstraction Reaction of α-Heteroatom Substituted Compounds byt-Butoxy Radical [PDF]
Kenji Uneyama+2 more
openalex +1 more source