Busy Man’s Synthesis: Combinational Delay Optimization With SAT

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.

Logic rewriting is a powerful optimization technique that replaces small sections of a Boolean network with better implementations. Typically, exact synthesis is used to compute optimum replacement on-the-fly, with possible support for Boolean don't cares. ...

Decentralized storage networks offer services with intriguing possibilities to reduce inequalities in an extremely centralized market. Fair distribution of rewards, however, is still a persistent problem in the current generation of decentralized applicati ...

We study the proof theory and algorithms for orthologic, a logical system based on ortholattices, which have shown practical relevance in simplification and normalization of verification conditions. Ortholattices weaken Boolean algebras while having polyno ...

Rapid single-flux quantum (RSFQ) is one of the most advanced and promising superconducting logic families, offering exceptional energy efficiency and speed. RSFQ technology requires delay registers (DFFs) and splitter cells to satisfy the path-balancing an ...

Cutting plane methods are a fundamental approach for solving integer linear programs (ILPs). In each iteration of such methods, additional linear constraints (cuts) are introduced to the constraint set with the aim of excluding the previous fractional opti ...

Deep learning has revolutionized the field of computer vision, a success largely attributable to the growing size of models, datasets, and computational power. Simultaneously, a critical pain point arises as several computer vision applications are deploye ...

In-network devices around the world monitor and tamper with connections for many reasons, including intrusion prevention, combating spam or phishing, and country-level censorship. Connection tampering seeks to block access to specific domain names or keywo ...

In control system networks, reconfiguration of the controller when agents are leaving or joining the network is still an open challenge, in particular when operation constraints that depend on each agent's behavior must be met. Drawing our motivation from ...

In this thesis, we give new approximation algorithms for some NP-hard problems arising in resource allocation and network design. As a resource allocation problem, we study the Santa Claus problem (also known as the MaxMin Fair Allocation problem) in which ...

We study an energy market composed of producers who compete to supply energy to different markets and want to maximize their profits. The energy market is modeled by a graph representing a constrained power network where nodes represent the markets and lin ...

Artificial Neural Networks (ANN) are habitually trained via the back-propagation (BP) algorithm. This approach has been extremely successful: Current models like GPT-3 have O(10 11 ) parameters, are trained on O(10 11 ) words and produce awe-inspiring resu ...

Incidents where water networks are contaminated with microorganisms or pollutants can result in a large number of infected or ill persons, and it is therefore important to quickly detect, localize and estimate the spread and source of the contamination. In ...

This thesis focuses on two selected learning problems: 1) statistical inference on graphs models, and, 2) gradient descent on neural networks, with the common objective of defining and analysing the measures that characterize the fundamental limits. In th ...

Headwater streams often experience intermittent flow. Consequently, the flowing drainage network expands and contracts and the flowing drainage density (DD) varies over time. Monitoring the DD dynamics is essential to understand the processes controlling i ...

We are used to defining network neutrality as absence of traffic differentiation, like policing or shaping. These mechanisms, however, are often not what determines end-users’ quality of experience (QoE). Most content today is accessed through edge caches, ...

This paper studies the problem of online performance optimization of constrained closed-loop control systems, where both the objective and the constraints are unknown black-box functions affected by exogenous time-varying contextual disturbances. A primal- ...

An integer linear program is a problem of the form max{c^T x : Ax=b, x >= 0, x integer}, where A is in Z^(n x m), b in Z^m, and c in Z^n. Solving an integer linear program is NP-hard in general, but there are several assumptions for which it becomes fixed ...

Finding cycles in directed graphs enables important applications in various domains such as finance, biology, chemistry, and network science. However, as the size of graph datasets continues to grow, it becomes increasingly difficult to discover cycles wit ...

This work addresses the problem of learning the topology of a network from the signals emitted by the network nodes. These signals are generated over time through a linear diffusion process, where neighboring nodes exchange messages according to the underl ...

Time-sensitive networks, as in the context of IEEE Time-Sensitive Networking (TSN) and IETF Deterministic Networking (DetNet), offer deterministic services with guaranteed bounded latency in order to support safety-critical applications. In this thesis, we ...

Busy Man’s Synthesis: Combinational Delay Optimization With SAT

Chat with Graph Search

Scalable Logic Rewriting Using Don’t Cares

Altruism, reciprocity, and tokens to reward forwarding data: Is that fair?

Orthologic with Axioms

Algebraic and Boolean Methods for SFQ Superconducting Circuits

Learning to Remove Cuts in Integer Linear Programming

Fast and Future: Towards Efficient Forecasting in Video Semantic Segmentation

Global, Passive Detection of Connection Tampering

Model Predictive Control for Multi-Agent Systems under Limited Communication and Time-Varying Network Topology

Approximation Algorithms for Allocation and Network Design

Equilibria in Network Constrained Energy Markets

Artificial Neural Network Training on an Optical Processor via Direct Feedback Alignment

Estimating pollution spread in water networks as a Schrödinger bridge problem with partial information

Fundamental Limits in Statistical Learning Problems: Block Models and Neural Networks

Short-term dynamics of drainage density based on a combination of channel flow state surveys and water level measurements

Caching and Neutrality

Primal-Dual Contextual Bayesian Optimization for Control System Online Optimization with Time-Average Constraints

Results on Sparse Integer Programming and Geometric Independent Sets

Fast Parallel Algorithms for Enumeration of Simple, Temporal, and Hop-Constrained Cycles

Estimating the Topology of Preferential Attachment Graphs Under Partial Observability

Worst-Case Delay Analysis of Time-Sensitive Networks with Network Calculus