Reduction of stochastic parity to stochastic mean-payoff games

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Knapsack problems give a simple framework for decision making. A classical example is the min-knapsack problem (MinKnap): choose a subset of items with minimum total cost, whose total profit is above a given threshold. While this model successfully general ...

This letter studies the measurement scheduling problem for a group of

N

mobile robots moving on a flat surface that are preforming cooperative localization (CL). We consider a scenario in which due to the limited on-board resources such as battery life a ...

Multiview applications endow final users with the possibility to freely navigate within 3D scenes with minimum-delay. A real feeling of scene navigation is enabled by transmitting multiple high-quality camera views, which can be used to synthesize addition ...

In this thesis we give new algorithms for two fundamental graph problems. We develop novel ways of using linear programming formulations, even exponential-sized ones, to extract structure from problem instances and to guide algorithms in making progress. S ...

Decreasing defects, waste time, meeting customer demand and being adaptable are the goals of a Zero Defect Manufacturing (ZDM) strategy. Scheduling is an important tool to perform that. It should take in account buffer size allocation. In this study, a met ...

Nonspecific protein adhesion to nanoparticle (NP) has been proven to have important implications in nanomedicine. However, there are only a few examples of careful studies relating protein binding thermodynamics to NP physicochemical features. In particula ...

Rapid advances in data collection and processing capabilities have allowed for the use of increasingly complex models that give rise to nonconvex optimization problems. These formulations, however, can be arbitrarily difficult to solve in general, in the s ...

In this article, the design of a quality control network is considered in an entire supply chain, in the context of an international food and beverage company, denoted as ABC. For each possible control point of the network, two decisions have to be made: ( ...

Vulnerability metrics play a key role in the understanding of cascading failures and target/random attacks to a network. The graph fragmentation problem (GFP) is the result of a worst-case analysis of a random attack. We can choose a fixed number of indivi ...

We present an analytical model to describe the stability of arbitrary semiconducting nanoparticle (NP) superlattices as a function of the dipole and polarizability of their constituents. We first validate our model by comparison with density functional the ...

For any unsatisfiable CNF formula F that is hard to refute in the Resolution proof system, we show that a gadget-composed version of F is hard to refute in any proof system whose lines are computed by efficient communication protocols-or, equivalently, tha ...

Reduction of stochastic parity to stochastic mean-payoff games

Chat with Graph Search

On approximation algorithms and polyhedral relaxations for knapsack problems, and clustered planarity testing

Measurement Scheduling for Cooperative Localization in Resource-Constrained Conditions

Adaptive Streaming in Interactive Multiview Video Systems

New Graph Algorithms via Polyhedral Techniques

A Computational Method for Identifying the Optimum Buffer Size in the Era of Zero Defect Manufacturing

On the effect of ligand shell heterogeneity on nanoparticle/protein binding thermodynamics

Second-order guarantees in centralized, federated and decentralized nonconvex optimization

Design of a quality control network for an international food company

Graph fragmentation problem: analysis and synthesis

Modeling Superlattices of Dipolar and Polarizable Semiconducting Nanoparticles

Monotone Circuit Lower Bounds from Resolution