Suchergebnisse - algorithmic logic with non-deterministic programs

Algorithmic Conflict Detection in Process-Oriented Programs von Permiashkin, Dmitry A., Zyubin, Vladimir E.

“… 4.0 force the minimal acceptable tolerance to the new heights. There are several algorithms and program paradigms which try to achieve that by removing all non-deterministic behaviour …”
Volltext

On the power of enzymatic numerical P systems von Vasile, Cristian Ioan, Pavel, Ana Brânduşa, Dumitrache, Ioan, Păun, Gheorghe

“… (with the same variable used in all programs or in only one , respectively); moreover, both deterministic and non-deterministic systems are considered …”
Volltext

A modular cost analysis for probabilistic programs von Avanzini, Martin, Moser, Georg, Schaper, Michael

“… We present a novel methodology for the automated resource analysis of non-deterministic, probabilistic imperative programs, which gives rise to a modular approach …”
Volltext

Updating action domain descriptions von Eiter, Thomas, Erdem, Esra, Fink, Michael, Senko, Ján

“… Unlike the formalisms considered in the related work, this language allows straightforward representation of non-deterministic effects and indirect effects of (possibly concurrent …”
Volltext

On the power of deep pushdown stacks von Quesada, Argimiro Arratia, Stewart, Iain A.

“… Inspired by recent work of Meduna on deep pushdown automata, we consider the computational power of a class of basic program schemes, NPSDS s , based around assignments, while-loops and non …”
Volltext

Conditionally Executed Tests, Branching and Algorithmic Binning - Getting IT Right von Chan, Lai-Choon

“… Test programs for large SOCs contain complex flow and binning logic. To perform tasks such as memory repair, trimming and speed binning, flows are non-deterministic and incorporate branching, loops and conditional test execution …”
Volltext

Separating Complexity Classes Using Autoreducibility von Buhrman, Harry, Fortnow, Lance, van Melkebeek, Dieter, Torenvliet, Leen

“… Although we already knew how to separate these classes using diagonalization, our proofs separate classes solely by showing they have different structural properties, thus applying Post's program to complexity theory …”
Volltext

Intuitionistic Letcc via Labelled Deduction von Reed, Jason, Pfenning, Frank

“… The well-known embedding of intuitionistic logic into classical modal logic means that intuitionistic logic can be viewed as a calculus of labelled deduction on multiple-conclusion sequents …”
Volltext

Considerations on Approaches and Metrics in Automated Theorem Generation/Finding in Geometry von Quaresma, Pedro, Graziani, Pierluigi, Nicoletti, Stefano M

“… The pursue of what are properties that can be identified to permit an automated reasoning program to generate and find new and interesting theorems is an interesting research goal (pun intended …”
Volltext

Algebra-based Synthesis of Loops and their Invariants (Invited Paper) von Humenberger, Andreas, Kovacs, Laura

“… We first describe an algorithmic approach for synthesising all polynomial equality invariants of such non-deterministic numeric single-path loops …”
Volltext

Techniques for Efficient Regular Expression Matching Across Hardware Architectures von Wang, Xiang

“… : memory-based and logic-based solutions. In both cases, the design aims to maximize the processing throughput and minimize the resources requirements, either in terms of memory or of logic cells …”
Volltext