The following pages link to Fundamenta Informaticae (Q2803574):
Displayed 50 items.
- Probabilistic timed automata with clock-dependent probabilities (Q1685793) (← links)
- Slicing concurrent constraint programs (Q2409727) (← links)
- Lpopt: a rule optimization tool for answer set programming (Q2409731) (← links)
- A Causal View on Non-Interference* (Q2803575) (← links)
- Synthesis of Live and Bounded Persistent Systems (Q2803576) (← links)
- Catching a Structural Bug with a Flower (Q2803577) (← links)
- Soundness of Timed-Arc Workflow Nets in Discrete and Continuous-Time Semantics (Q2803579) (← links)
- Maximizing T-complexity (Q2804173) (← links)
- Characterising Concurrent Histories (Q2804174) (← links)
- Particle Swarm Optimization based Sequential and Parallel Tasks Scheduling Model for Heterogeneous Multiprocessor Systems (Q2804175) (← links)
- Multigranulation Decision-theoretic Rough Set in Ordered Information System (Q2804176) (← links)
- Immunological Computation for Protein Function Prediction (Q2804180) (← links)
- A Clustering Based Archive Multi Objective Gravitational Search Algorithm (Q2804183) (← links)
- On Algorithmic Equivalence of Instruction Sequences for Computing Bit String Functions (Q2804184) (← links)
- Hybrid Cloud Scheduling Method for Cloud Bursting (Q2804185) (← links)
- Self-Correcting Neural Network for Stereo-matching Problem Solving (Q2804188) (← links)
- True Concurrency in Long-running Transactions for Digital Ecosystems (Q2804190) (← links)
- Modelling Progressive Filtering (Q2804192) (← links)
- A Fast and Automated Granulometric Image Analysis Based on Digital Geometry (Q2804193) (← links)
- Complete Characterization of Zero-expressible Functions (Q2804194) (← links)
- Homomorphisms Between Covering Approximation Spaces (Q2804195) (← links)
- Efficiently Mining Sequential Generator Patterns Using Prefix Trees (Q2804197) (← links)
- On the Power of Accepting Networks of Evolutionary Processors with Special Topologies and Random Context Filters (Q2805395) (← links)
- The Supports of Weighted Unranked Tree Automata (Q2805397) (← links)
- Catalytic and Purely Catalytic P Systems and P Automata: Control Mechanisms for Obtaining Computational Completeness (Q2805398) (← links)
- Power of S-kR-RRWW-automata (Q2805400) (← links)
- Minimization and Characterizations for Biautomata (Q2805401) (← links)
- Deterministic One-Way Turing Machines with Sublinear Space (Q2805402) (← links)
- Limited Automata and Context-Free Languages (Q2805404) (← links)
- Asynchronous Systems of Parallel Communicating Finite Automata (Q2805406) (← links)
- Parameterized Complexity of Weighted Satisfiability Problems: Decision, Enumeration, Counting (Q2805407) (← links)
- Discrete Duality for Tense Łukasiewicz–Moisil Algebras (Q2805408) (← links)
- An Algorithmic Construction of Finite Elliptic Curves of Order Divisible by a Large Prime (Q2805409) (← links)
- A Horizontal Mesh Algorithm for a Class of Edge-bipartite Graphs and their Matrix Morsifications (Q2805410) (← links)
- Consistency-based Revision of Structured Belief Bases (Q2805411) (← links)
- Simultaneous Feature Selection and Extraction Using Feature Significance (Q2805413) (← links)
- Bases for AC0 and Other Complexity Classes (Q2805414) (← links)
- On Projection Based Operators in lp Space for Exact Similarity Search (Q2805415) (← links)
- Complexity Analysis of Continuous Petri Nets (Q2805416) (← links)
- ω-Petri Nets: Algorithms and Complexity (Q2805418) (← links)
- Complexity Results for Problems of Communication-Free Petri Nets and Related Formalisms (Q2805419) (← links)
- Generalizing the Compositions of Petri Nets Modules (Q2805421) (← links)
- Verification of Scenarios in Petri Nets Using Compact Tokenflows (Q2805422) (← links)
- Persistent and Nonviolent Steps and the Design of GALS Systems (Q2805425) (← links)
- Formal Framework for Data Mining with Association Rules and Domain Knowledge – Overview of an Approach (Q2805426) (← links)
- A Locality Sensitive Hashing Filter for Encrypted Vector Databases (Q2805427) (← links)
- Communication Complexity of Consensus in Anonymous Message Passing Systems (Q2805428) (← links)
- Description Languages for Relational Information Granules (Q2805429) (← links)
- Tolerances Induced by Irredundant Coverings (Q2805430) (← links)
- Fast Convergence of Distance-based Inconsistency in Pairwise Comparisons (Q2805431) (← links)