Search
Search Results
-
Open-Separating Dominating Codes in Graphs
Using dominating sets to separate vertices of graphs is a well-studied problem in the larger domain of identification problems. In such problems, the...
-
Minimizing External Vertices in Hypergraph Orientations
We introduce the problem of assigning a direction to the hyperedges of a hypergraph such that the number of source and sink vertices is minimized. We...
-
Surrogate Constraints for Synchronized Energy Production/Consumption
We deal here with job scheduling under encapsulated renewable and non-renewable resource constraints, while relying on a case study related to energy...
-
Neuron Pairs in Binarized Neural Networks Robustness Verification via Integer Linear Programming
In the context of classification, robustness verification of a neural network is the problem which consists in determining if small changes of inputs...
-
Optimal Cycle Selections: An Experimental Assessment of Integer Programming Formulations
In this paper, we conduct numerical experiments to test the effectiveness of several integer programming formulations of the cycle selection problem....
-
Approximation Algorithm for Job Scheduling with Reconfigurable Resources
We consider a scheduling problem with reconfigurable resources. Several types of jobs have to be processed by a set of identical resources (e.g....
-
Reducing Treewidth for SAT-Related Problems Using Simple Liftings
Tree decompositions are a powerful tool to obtain parameterized algorithms, in particular to solve different variants of the satisfiability problem....
-
Optimal Charging Station Location in a Linear Cycle Path with Deviations
Bicycle tourism is on the rise thanks to assisted-pedaling bikes, also known as e-bikes. While pedalling is still required on these bikes, they allow...
-
On a Geometric Graph-Covering Problem Related to Optimal Safety-Landing-Site Location
We develop a set-cover based integer-programming approach to an optimal safety-landing-site location arising in the design of urban...
-
Branch and Cut for Partitioning a Graph into a Cycle of Clusters
In this paper we study formulations and algorithms for the cycle clustering problem, a partitioning problem over the vertex set of a directed graph...
-
Control Actions
This chapter analyses the functional relations between a control system and the process in a SCPS by applying the dyadic and triadic transformation...
-
Technical Artefacts and Humans
The purposes of this chapter are to explain the nature of a technical artefact, and to introduce social-cyber-physical-systems (SCPS) as the...
-
Ends, Means and Functions
The purpose of this chapter is to clarify the distinction between goals and objectives which can be considered as different types of ends....
-
Dyadic Transformations
The purpose of this chapter is to use the action types described in Chap. 10 to define basic generic...
-
Action Phases
The purpose this chapter is to introduce temporal aspects of actions in more details including a discussion of their relations to causal roles of...
-
Integrated Timed Architectural Modeling/Execution Language
We discuss an integrated approach for the design, specification, automatic deployment and simulation of microservice-based applications based on the...
-
Actors Upgraded for Variability, Adaptability, and Determinism
The Rebeca modeling language is designed as an imperative actor-based language with the goal of providing an easy-to-use language for modeling...
-
Context-Aware Trace Contracts
The behavior of concurrent, asynchronous procedures depends in general on the call context, because of the global protocol that governs scheduling....
-
A Survey of Actor-Like Programming Models for Serverless Computing
Serverless computing promises to significantly simplify cloud computing by providing Functions-as-a-Service where invocations of functions, triggered...
-
Online Matching with Stochastic Rewards: Advanced Analyses Using Configuration Linear Programs
Mehta and Panigrahi (2012) proposed Online Matching with Stochastic Rewards, which generalizes the Online Bipartite Matching problem of Karp,...