Skip to content
<title>Channels - Improved Algorithms for Parity and Streett objectives :: FRELIP Discovery
Home
Search
Guides
Journals
Learning
FRELIP Discovery Search
Open Access Catalog for African Scholarship
Channels
Improved Algorithms for Parity and Streett objectives
Search for more channels:
Similar Items: Improved Algorithms for Parity and Streett objectives
Channel Options
View Record
Explore related channels
Quick Look
Parity and Streett Games with Costs
Quick Look
From Nondeterministic Büchi and Streett Automata to Deterministic Parity Automata
Quick Look
Parity Games with Weights
Quick Look
Timed Parity Games: Complexity and Robustness
Quick Look
Dynamic Complexity of Parity Exists Queries
Quick Look
Stochastic Parity Games on Lossy Channel Systems
Quick Look
A Recursive Approach to Solving Parity Games in Quasipolynomial Time
Quick Look
Easy to Win, Hard to Master: Optimal Strategies in Parity Games with Costs
Quick Look
Time and Parallelizability Results for Parity Games with Bounded Tree and DAG Width
Quick Look
Lacon-, Shrub- and Parity-Decompositions: Characterizing Transductions of Bounded Expansion Classes
Quick Look
Beyond Value Iteration for Parity Games: Strategy Iteration with Universal Trees
Quick Look
An Objective Improvement Approach to Solving Discounted Payoff Games
Quick Look
An Improved RT-DETR-Based Object Detection Algorithm for UAV Aerial Photography
Quick Look
A Global Position Estimation Algorithm for Multi-Camera Multi-Object Tracking
Quick Look
An Improved Yolo Algorithm Based on Concise Decoupled Head for Real-Time Object Detection in Night Scenarios
Quick Look
An Inverse recursive algorithm to retrieve the shape of the inaccessible dielectric objects
Quick Look
Multiactive objects and their applications
Quick Look
Comments and Corrections Corrections to “YOLOv8-SCS: Improved Object Detection for Autonomous Driving Under Adverse Weather Conditions”
Quick Look
Modular session types for objects
Quick Look
The Sierpinski Object in the Scott Realizability Topos
Quick Look
A Step-indexed Semantics of Imperative Objects
Quick Look
Computing with Infinite Objects: the Gray Code Case
Quick Look
Multi-Objective Model Checking of Markov Decision Processes
Quick Look
Analysis of Timed and Long-Run Objectives for Markov Automata
Load more items
View Record
Prev
Explore related channels
Next
