Filters








22,578 Hits in 6.6 sec

Real-Time Level of Autonomy Adaptation for Human-Machine-Interaction Based on the Reaction Time

E. Badreddin, A. Wagner
<span title="">2011</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/p3wtlm3j2fedxitkuu4bs3scau" style="color: black;">IFAC Proceedings Volumes</a> </i> &nbsp;
The topology of the system is based on a recursive nested behaviour-based control structure, which is an abstraction of multiple cascaded control loops.  ...  A generic system model and a control scheme for the real-time adaptation of autonomy level for Human-Machine-Interaction are proposed.  ...  The lower levels contain the more dynamic (reflexive) behaviours and the upper levels the more complex (cognitive) Fig. 5 . 5 Identification of a human reference model by comparison to the upper part  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.3182/20110828-6-it-1002.02815">doi:10.3182/20110828-6-it-1002.02815</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/moyedmgpfne7pgndeumsznlyae">fatcat:moyedmgpfne7pgndeumsznlyae</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170829204827/http://folk.ntnu.no/skoge/prost/proceedings/ifac11-proceedings/data/html/papers/2815.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/e2/dd/e2dd20b83691b9608cb70e884a6aa030f6fd9fe9.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.3182/20110828-6-it-1002.02815"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> Publisher / doi.org </button> </a>

Toward an abstract theory of data compression

James A. Storer
<span title="">1983</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/elaf5sq7lfdxfdejhkqbtz6qoq" style="color: black;">Theoretical Computer Science</a> </i> &nbsp;
Section 2 also discusses some basic properties of abstract hemes. Section 3 discusses complexity classes of schemes and conce-r sf an impwtasrt class of compression schemes called good comemes.  ...  Here, a model for an abstract compression 'scheme is proposed.  ...  For all schemes S, 0 c d (S f 5: 1,O 5 D (S 15 1 and there me good schertre.r. which obtdl these bounds. Proof. Clearly 0 and 1 are lower and upper bounds for d(S).  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/0304-3975(83)90001-4">doi:10.1016/0304-3975(83)90001-4</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/n74sgfm6zvgefc6hadh7giiaaa">fatcat:n74sgfm6zvgefc6hadh7giiaaa</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190306232833/https://core.ac.uk/download/pdf/82683114.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/31/fa/31fa29b719588aa32a1e2b4127c4569b3d27487f.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/0304-3975(83)90001-4"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> elsevier.com </button> </a>

Time-bounded reachability in tree-structured QBDs by abstraction

Daniel Klink, Anne Remke, Boudewijn R. Haverkort, Joost-Pieter Katoen
<span title="">2011</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/ie2sxzzlsraaroxezes23o7rs4" style="color: black;">Performance evaluation (Print)</a> </i> &nbsp;
Results show that gridlike schemes, in contrast to chain-and tree-like ones, yield extremely precise approximations for rather coarse abstractions. Organization of the paper.  ...  We contrast abstraction based on Markov decision processes (MDPs) and interval-based abstraction; study various schemes to partition the state space, and empirically show their influence on the accuracy  ...  E5: Upper and lower bounds for bd, tree, qbd and (q)grid abstractions with similar sized state spaces for k = 0. This still is a very natural partitioning scheme.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/j.peva.2010.04.002">doi:10.1016/j.peva.2010.04.002</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/f3oak6daczca3mbqqbw3zoq5wm">fatcat:f3oak6daczca3mbqqbw3zoq5wm</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20180722190414/https://ris.utwente.nl/ws/files/5412617/treeqbd.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/a0/3c/a03cd5c6078c73321f413fbde0c870f12ca9da15.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/j.peva.2010.04.002"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> elsevier.com </button> </a>

Time-Bounded Reachability in Tree-Structured QBDs by Abstraction

Daniel Klink, Anne Remke, Boudewijn R. Haverkort, Joost-Pieter Katoen
<span title="">2009</span> <i title="IEEE"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/mr2re5en4rajnjdlytdvj35iyy" style="color: black;">2009 Sixth International Conference on the Quantitative Evaluation of Systems</a> </i> &nbsp;
Results show that gridlike schemes, in contrast to chain-and tree-like ones, yield extremely precise approximations for rather coarse abstractions. Organization of the paper.  ...  We contrast abstraction based on Markov decision processes (MDPs) and interval-based abstraction; study various schemes to partition the state space, and empirically show their influence on the accuracy  ...  E5: Upper and lower bounds for bd, tree, qbd and (q)grid abstractions with similar sized state spaces for k = 0. This still is a very natural partitioning scheme.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/qest.2009.9">doi:10.1109/qest.2009.9</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/qest/KlinkRHK09.html">dblp:conf/qest/KlinkRHK09</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/oatprsbbxbco5ak5of5pf643da">fatcat:oatprsbbxbco5ak5of5pf643da</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20180722190414/https://ris.utwente.nl/ws/files/5412617/treeqbd.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/a0/3c/a03cd5c6078c73321f413fbde0c870f12ca9da15.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/qest.2009.9"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> ieee.com </button> </a>

Approximate Policy Iteration for Markov Decision Processes via Quantitative Adaptive Aggregations [chapter]

Alessandro Abate, Milan Češka, Marta Kwiatkowska
<span title="">2016</span> <i title="Springer International Publishing"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2w3awgokqne6te4nvlofavy5a4" style="color: black;">Lecture Notes in Computer Science</a> </i> &nbsp;
In this paper we propose a new approximate policy iteration scheme that mitigates the state-space explosion problem by adaptive state-space aggregation, at the same time providing rigorous and explicit  ...  Since the explicit iterative dynamical programming scheme does not scale when increasing the dimension of the state space, a number of approximate methods have been developed.  ...  Češka), and the John Fell Oxford University Press (OUP) Research Fund.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-319-46520-3_2">doi:10.1007/978-3-319-46520-3_2</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/ptybq4cadvez5gpf4p3wdkagve">fatcat:ptybq4cadvez5gpf4p3wdkagve</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190218091553/http://pdfs.semanticscholar.org/0aaa/79bfcc2c441f38fdeea00c947dd8f54d1405.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/0a/aa/0aaa79bfcc2c441f38fdeea00c947dd8f54d1405.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-319-46520-3_2"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Adaptive Aggregation of Markov Chains: Quantitative Analysis of Chemical Reaction Networks [chapter]

Alessandro Abate, Luboš Brim, Milan Češka, Marta Kwiatkowska
<span title="">2015</span> <i title="Springer International Publishing"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2w3awgokqne6te4nvlofavy5a4" style="color: black;">Lecture Notes in Computer Science</a> </i> &nbsp;
schemes.  ...  The new approach, which can be used in conjunction with time uniformisation techniques, is evaluated on two models of chemical reaction networks, a signalling pathway and a prokaryotic gene expression  ...  the sum of the lower bound and the probability lost gives an upper bound for the point-wise error.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-319-21690-4_12">doi:10.1007/978-3-319-21690-4_12</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/4ueynlohybhvbcw7vhlb72sylm">fatcat:4ueynlohybhvbcw7vhlb72sylm</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170810235542/http://www.cs.ox.ac.uk/people/alessandro.abate/publications/bcABCK15.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/de/ca/decac887b8e469a6f6bdae9e43290a4fa3a0ed2a.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-319-21690-4_12"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Quantitative Approximation of the Probability Distribution of a Markov Process by Formal Abstractions

Sadegh Esmaeil Zadeh Soudjani, Alessandro Abate, Erika Abraham
<span title="2015-09-04">2015</span> <i title="Logical Methods in Computer Science e.V."> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/c67srop7pbe3nciquoxzy3d6pm" style="color: black;">Logical Methods in Computer Science</a> </i> &nbsp;
The goal of this work is to formally abstract a Markov process evolving in discrete time over a general state space as a finite-state Markov chain, with the objective of precisely approximating its state  ...  can lead to improved error bounds and associated lower computational requirements.  ...  The authors plan to integrate the presented procedures within the software tool FAUST 2 , which is developed for the formal abstraction and verification of uncountable-state stochastic processes [16]  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.2168/lmcs-11(3:8)2015">doi:10.2168/lmcs-11(3:8)2015</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/gbziv27m7fdt3lsvueir35xuea">fatcat:gbziv27m7fdt3lsvueir35xuea</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20180721104042/https://lmcs.episciences.org/1584/pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/f7/b5/f7b551117c518c33b7d000ebf0b0776348d52c4e.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.2168/lmcs-11(3:8)2015"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="unlock alternate icon" style="background-color: #fb971f;"></i> Publisher / doi.org </button> </a>

On low-complexity approximation of matrices

Alle-Jan van der Veen, Patrick Dewilde
<span title="">1994</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/wsx3rzhpingfvewcn5nwhfkq3e" style="color: black;">Linear Algebra and its Applications</a> </i> &nbsp;
The operation of multiplication of a vector by a matrix can be represented by a computational scheme (or model) that acts sequentially on the entries of the vector.  ...  The number of intermediate quantities ("states") that are needed in the computations is a measure of the complexity of the model. If that complexity is low, then not only 1.  ...  A full matrix can be decomposed into an upper and a lower part, each of which can be approximated separately. A scheme for doing matrix inversions using such a decomposition has been published [9] .  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/0024-3795(94)90383-2">doi:10.1016/0024-3795(94)90383-2</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/357qwhbo5vhcvm2ayzelgxmqmu">fatcat:357qwhbo5vhcvm2ayzelgxmqmu</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20171001163156/http://publisher-connector.core.ac.uk/resourcesync/data/elsevier/pdf/a6c/aHR0cDovL2FwaS5lbHNldmllci5jb20vY29udGVudC9hcnRpY2xlL3BpaS8wMDI0Mzc5NTk0OTAzODMy.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/d5/72/d5721d2cf087eb789b74db558d71540d50473dd2.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/0024-3795(94)90383-2"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> elsevier.com </button> </a>

PASS: Abstraction Refinement for Infinite Probabilistic Models [chapter]

Ernst Moritz Hahn, Holger Hermanns, Björn Wachter, Lijun Zhang
<span title="">2010</span> <i title="Springer Berlin Heidelberg"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2w3awgokqne6te4nvlofavy5a4" style="color: black;">Lecture Notes in Computer Science</a> </i> &nbsp;
PASS is based on predicate abstraction and abstraction refinement and scales to programs far beyond the reach of numerical methods which operate on the full state space of the model.  ...  The computational engines we use are SMT solvers to compute finite abstractions, numerical methods to compute probabilities and interpolation as part of abstraction refinement.  ...  Then the lower and upper bound probabilities are computed by value iteration.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-642-12002-2_30">doi:10.1007/978-3-642-12002-2_30</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/i6lthhwblzchtgls3oqorsabqu">fatcat:i6lthhwblzchtgls3oqorsabqu</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20180726131948/https://link.springer.com/content/pdf/10.1007%2F978-3-642-12002-2_30.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/f6/fd/f6fd82d5cbfaec2239cc4409b22b9e350bfd6eb1.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-642-12002-2_30"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Wiring space and length estimation in two-dimensional arrays

Jun Dong Cho
<span title="">2000</span> <i title="Institute of Electrical and Electronics Engineers (IEEE)"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/rl7xk4fwazdrred2difr6v3lii" style="color: black;">IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems</a> </i> &nbsp;
We propose an approximate upper bound on global cell 2 log( (2 )), in an two-dimensional array, where is the estimated lowerbound density.  ...  A solution to this problem can be used for quick estimation of necessary wiring space (for standard cell array designs) and difficulty of routing (for gate array designs) in the early design planning stage  ...  CONCLUSION In this paper, by incorporating the flat approximation into routing of each level of top-down recursion, we obtain in O(n log m) time a new and tight approximate lower and upper-bound on the  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/43.845086">doi:10.1109/43.845086</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/smcty45x3bfuth6aelpbfbpuku">fatcat:smcty45x3bfuth6aelpbfbpuku</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170829032316/http://vada.skku.ac.kr/Research/published/rout-est.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/e5/dc/e5dc3abf271cab0e9c11d94abbd46d18725750e5.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/43.845086"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> ieee.com </button> </a>

Perturbed affine arithmetic for invariant computation in numerical program analysis [article]

Eric Goubault, Sylvie Putot
<span title="2008-07-18">2008</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
Good evidence shows it behaves well also for some non-linear schemes. The result, and the structure of the domain, rely on an interesting interplay between order and topology.  ...  Fixpoint iteration in this domain is proved to converge to finite precise invariants for (at least) the class of stable linear recursive filters of any order.  ...  A crucial point is that our abstract domain is both almost a bounded complete lattice, and an ordered Banach space, where approximation theorems and convergence properties of numerical schemes naturally  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/0807.2961v1">arXiv:0807.2961v1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/xysug42whbfo5llxrgckb7rg5e">fatcat:xysug42whbfo5llxrgckb7rg5e</a> </span>
<a target="_blank" rel="noopener" href="https://archive.org/download/arxiv-0807.2961/0807.2961.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> File Archive [PDF] </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/0807.2961v1" title="arxiv.org access"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> arxiv.org </button> </a>

Parallelizable approximate solvers for recursions arising in preconditioning

Yair Shapira
<span title="">1998</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/wsx3rzhpingfvewcn5nwhfkq3e" style="color: black;">Linear Algebra and its Applications</a> </i> &nbsp;
For the recursions used in the modified incomplete LU preconditioner, namely, the construction of incomplete decomposition, the forward elimination, and the back substitution, parallelizable approximate  ...  The analysis shows that the solutions of the recursions depend only weakly on their initial conditions, which may be interpreted to indicate that the inexact solution is close, in some sense, to the exact  ...  The variables on the thin lines in (b) are computed by one SIMD or vector operation. upper left triangular subdomain in Figure 2(a) and approximate in the lower right one, where it uses initial conditions  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/s0024-3795(97)00339-x">doi:10.1016/s0024-3795(97)00339-x</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/yht54xef7zcl7kklg4aijj3ko4">fatcat:yht54xef7zcl7kklg4aijj3ko4</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190418100537/https://core.ac.uk/download/pdf/82239769.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/e6/81/e681b8ab1edc3657efa9525b4562a7fccb3e7892.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/s0024-3795(97)00339-x"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> elsevier.com </button> </a>

Page 2108 of Mathematical Reviews Vol. , Issue 83e [page]

<span title="">1983</span> <i title="American Mathematical Society"> <a target="_blank" rel="noopener" href="https://archive.org/details/pub_mathematical-reviews" style="color: black;">Mathematical Reviews </a> </i> &nbsp;
Next, it is demonstrated that these abstract ODE may be approximated by difference equations in finite-dimensional spaces.  ...  In numerical realization on a computer certain schemes for symmetric methods of minimizing unimodal functions become unstable and do  ... 
<span class="external-identifiers"> </span>
<a target="_blank" rel="noopener" href="https://archive.org/details/sim_mathematical-reviews_1983-05_83e/page/2108" title="read fulltext microfilm" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Archive [Microfilm] <div class="menu fulltext-thumbnail"> <img src="https://archive.org/serve/sim_mathematical-reviews_1983-05_83e/__ia_thumb.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a>

Automatic abstraction techniques for propositional μ-calculus model checking [chapter]

Abelardo Pardo, Gary D. Hachtel
<span title="">1997</span> <i title="Springer Berlin Heidelberg"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2w3awgokqne6te4nvlofavy5a4" style="color: black;">Lecture Notes in Computer Science</a> </i> &nbsp;
It then successively re nes, with respect to this goal set, the approximations made in the sub-formulas, until the given formula is veri ed or computational resources are exhausted.  ...  Necessary conditions for conservative veri cation are provided, along with a fully automatic symbolic model checking abstraction algorithm.  ...  Although this approach used both upper and lower bounds, and included a complete procedure for re ning the initial approximation, it was limited to 8CTL.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/3-540-63166-6_5">doi:10.1007/3-540-63166-6_5</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/mj2hmat6cfanhdqbinnwxgjaf4">fatcat:mj2hmat6cfanhdqbinnwxgjaf4</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190303020124/http://pdfs.semanticscholar.org/ad67/099543b4eb4747900d3d84735be481f4cea1.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/ad/67/ad67099543b4eb4747900d3d84735be481f4cea1.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/3-540-63166-6_5"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Computability over Topological Structures [chapter]

Vasco Brattka
<span title="">2003</span> <i title="Springer US"> Computability and Models </i> &nbsp;
In this paper we summarize some basic ideas of the representation based approach to computable analysis and we introduce an abstract and purely set theoretic characterization of this theory which can be  ...  In this context the choice of representations is very sensitively related to the underlying notion of approximation, hence to topology.  ...  Acknowledgement The author would like to thank Klaus Weihrauch, Matthias Schröder and the anonymous referee for several helpful comments, suggestions and corrections.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-1-4615-0755-0_5">doi:10.1007/978-1-4615-0755-0_5</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/7v4cgwf5xnafxdbaksc7axfmma">fatcat:7v4cgwf5xnafxdbaksc7axfmma</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20070821123833/http://cca-net.de/vasco/publications/model.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/84/fa/84fa79ae93d4486e7eded3e7b4021d9a5d59884d.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-1-4615-0755-0_5"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>
&laquo; Previous Showing results 1 &mdash; 15 out of 22,578 results