English
Related papers

Related papers: Compositional Reasoning for Explicit Resource Mana…

200 papers

Existing formalisms for the algebraic specification and representation of networks of reversible agents suffer some shortcomings. Despite multiple attempts, reversible declensions of the Calculus of Communicating Systems (CCS) do not offer…

Logic in Computer Science · Computer Science 2021-03-30 Clément Aubert , Doriana Medić

Data-driven optimization uses contextual information and machine learning algorithms to find solutions to decision problems with uncertain parameters. While a vast body of work is dedicated to interpreting machine learning models in the…

Machine Learning · Computer Science 2023-07-21 Alexandre Forel , Axel Parmentier , Thibaut Vidal

This paper presents the Pi-graphs, a visual paradigm for the modelling and verification of mobile systems. The language is a graphical variant of the Pi-calculus with iterators to express non-terminating behaviors. The operational semantics…

Formal Languages and Automata Theory · Computer Science 2010-11-02 Frédéric Peschanski , Hanna Klaudel , Raymond Devillers

We consider the problem of scheduling a set of $n$ tasks on $m$ processors under precedence, communication, and global system energy constraints to minimize makespan. We extend existing scheduling models to account for energy usage and give…

Data Structures and Algorithms · Computer Science 2011-05-27 David Felber , Adam Meyerson

We introduce a temporal model for reasoning on disjunctive metric constraints on intervals and time points in temporal contexts. This temporal model is composed of a labeled temporal algebra and its reasoning algorithms. The labeled…

Artificial Intelligence · Computer Science 2011-06-01 F. Barber

The Asynchronous pi-calculus, as recently proposed by Boudol and, independently, by Honda and Tokoro, is a subset of the pi-calculus which contains no explicit operators for choice and output-prefixing. The communication mechanism of this…

Programming Languages · Computer Science 2020-11-17 Catuscia Palamidessi

We use the term protocol coding to denote the communication strategies in which information is encoded through the actions taken by a certain communication protocol. In this work we investigate strategies for protocol coding via…

Information Theory · Computer Science 2012-02-03 Petar Popovski , Zoran Utkovski , Kasper F. Trillingsgaard

Computation is commonly defined as the execution of abstract algorithms over symbolic representations, with physical systems treated as substrates that realise predefined operations. While effective for engineered machines, this separation…

Physics and Society · Physics 2026-01-21 Kimia Witte

We introduce a new framework for quantifying the complexity of quantum channels, grounded in a suitably chosen resource set. This class of convex functions is designed to analyze the complexity of both open and closed quantum systems. By…

Quantum Physics · Physics 2026-01-12 Roy Araiza , Yidong Chen , Marius Junge , Peixue Wu

Standard approaches to decision-making under uncertainty focus on sequential exploration of the space of decisions. However, \textit{simultaneously} proposing a batch of decisions, which leverages available resources for parallel…

Machine Learning · Statistics 2023-02-07 Jeffrey Chan , Aldo Pacchiano , Nilesh Tripuraneni , Yun S. Song , Peter Bartlett , Michael I. Jordan

This paper presents a distributed resource selection mechanism for diverse cloud-edge environments, enabling dynamic and context-aware allocation of resources to meet the demands of complex distributed applications. By distributing the…

Distributed, Parallel, and Cluster Computing · Computer Science 2025-10-10 Quentin Renau , Amjad Ullah , Emma Hart

Introduced in 2006 by Japaridze, cirquent calculus is a refinement of sequent calculus. The advent of cirquent calculus arose from the need for a deductive system with a more explicit ability to reason about resources. Unlike the more…

Logic in Computer Science · Computer Science 2015-07-01 Matthew Steven Bauer

Concurrent separation logics have helped to significantly simplify correctness proofs for concurrent data structures. However, a recurring problem in such proofs is that data structure abstractions that work well in the sequential setting…

Logic in Computer Science · Computer Science 2017-11-10 Siddharth Krishna , Dennis Shasha , Thomas Wies

We consider a general multi-connectivity framework, intended for ultra-reliable low-latency communications (URLLC) services, and propose a novel, preallocation-based combinatorial auction approach for the efficient allocation of channels.…

Computer Science and Game Theory · Computer Science 2023-07-11 Dávid Csercsik , Eduard Jorswieck

The motivation for this work stems from the problem of scheduling requests for flow at supply points along an automated network of open-water channels. The off-take flows are rigid-profile inputs to the system dynamics. In particular, the…

Optimization and Control · Mathematics 2021-01-01 Adair Lang , Michael Cantoni , Farhad Farokhi , Iman Shames

AI tasks differ in complexity and are best addressed with different computation strategies (e.g., combinations of models and decoding methods). Hence, an effective routing system that maps tasks to the appropriate strategies is crucial.…

Computation and Language · Computer Science 2025-12-11 Peter Baile Chen , Weiyue Li , Dan Roth , Michael Cafarella , Samuel Madden , Jacob Andreas

Prescriptive process monitoring methods seek to optimize the performance of business processes by triggering interventions at runtime, thereby increasing the probability of positive case outcomes. These interventions are triggered according…

Artificial Intelligence · Computer Science 2025-05-20 Mahmoud Shoush , Marlon Dumas

The resources framework emphasizes the potential productivity of student intuitions for constructing a canonical understanding of physics. It models learning as the progressive coordination and refinement of these resources. Yet, there is a…

Physics Education · Physics 2019-09-05 Eric Kuo , Nolan K. Weinlader , Benjamin M. Rottman , Timothy J. Nokes-Malach

We consider the problem of estimating an upper bound on the capacity of a memoryless channel with unknown channel law and continuous output alphabet. A novel data-driven algorithm is proposed that exploits the dual representation of…

Information Theory · Computer Science 2024-01-25 Christian Häger , Erik Agrell

We investigate a graphical representation of session invocation interdependency in order to prove progress for the pi-calculus with sessions under the usual session typing discipline. We show that those processes whose associated dependency…

Programming Languages · Computer Science 2010-10-28 Marco Carbone , Søren Debois