SAT-Based Area Recovery in Structural Technology Mapping

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

This paper offers a new algorithm to efficiently optimize scheduling decisions for dial-a-ride problems (DARPs), including problem variants considering electric and autonomous vehicles (e-ADARPs). The scheduling heuristic, based on linear programming theor ...

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 ...

Technology mapping transforms a technology-independent representation into a technology-dependent one given a library of cells. Even if technology libraries contain multi-output cells, state-of-the-art techniques fully exploit single-output cells only. Mul ...

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 ...

Quantum computing has made significant progress in recent years, with Google and IBM releasing quantum computers with 72 and 50 qubits, respectively. Google has also achieved quantum supremacy with its 54-qubit device, and IBM has announced the release of ...

Chemical gas dispersion can represent a severe threat to human and animal lives, as well as to the environment. Constructing a map of the distribution of gas in a fast and reliable manner is critical to ensure accurate monitoring of at-risk facilities and ...

We present a lightweight goal-based model for multimodal, probabilistic trajectory prediction for urban driving. Previous conditioned-on-goal methods have used map information in order to establish a set of potential goals and then complete the correspondi ...

We show that a constant factor approximation of the shortest and closest lattice vector problem in any l(p)-norm can be computed in time 2((0.802 + epsilon)n). This matches the currently fastest constant factor approximation algorithm for the shortest vect ...

Forest maps are essential to understand forest dynamics. Due to the increasing availability of remote sensing data and machine learning models like convolutional neural networks, forest maps can these days be created on large scales with high accuracy. Com ...

We present a quasilinear time algorithm to decide the word problem on a natural algebraic structures we call orthocomplemented bisemilattices, a subtheory of boolean algebra. We use as a base a variation of Hopcroft, Ullman and Aho algorithm for tree isomo ...

Universal quantum algorithms that prepare arbitrary n-qubit quantum states require O(2n) gate complexity. The complexity can be reduced by considering specific families of quantum states depending on the task at hand. In particular, multipartite quantum st ...

We propose a new approach for normalization and simplification of logical formulas. Our approach is based on algorithms for lattice-like structures. Specifically, we present two efficient algorithms for computing a normal form and deciding the word problem ...

One of the most basic graph problems, All-Pairs Shortest Paths (APSP) is known to be solvable in n^{3-o(1)} time, and it is widely open whether it has an O(n^{3-ε}) time algorithm for ε > 0. To better understand APSP, one often strives to obtain subcubic t ...

Weighted flow time is a fundamental and very well-studied objective function in scheduling. In this paper, we study the setting of a single machine with preemptions. ...

We study the computations that Bayesian agents undertake when exchanging opinions over a network. The agents act repeatedly on their private information and take myopic actions that maximize their expected utility according to a fully rational posterior be ...

Astrobot swarms are used to capture astronomical signals to generate the map of the observable universe for the purpose of dark energy studies. The convergence of each swarm in the course of its coordination has to surpass a particular threshold to yield a ...

Centimetre level precision mapping is essential for many applications such as land-use, infrastructure inspection, cultural heritage preservation, and construction site monitoring. However, the acquisition and its preparation (in particular the setting of ...

An integer program (IP) is a problem of the form

\min \{f(x) : \, Ax = b, \ l \leq x \leq u, \ x \in \Z^n\}

, where

A \in \Z^{m \times n}

b \in \Z^m

l,u \in \Z^n

, and

f: \Z^n \rightarrow \Z

is a separable convex objective function. The problem o ...

Exact synthesis is a versatile logic synthesis technique with applications to logic optimization, technology mapping, synthesis for emerging technologies, and cryptography. In recent years, advances in SAT solving have lead to a heightened research effort ...

Logic synthesis is a key component of digital design and modern EDA tools; it is thus an essential instrument for the design of leading-edge chips and to push the limits of their performance. In the last decades, the electronic circuits community has evolv ...

SAT-Based Area Recovery in Structural Technology Mapping

Chattez avec Graph Search

A ride time-oriented scheduling algorithm for dial-a-ride problems

Approximation Algorithms for Allocation and Network Design

Technology Mapping Using Multi-output Library Cells

Results on Sparse Integer Programming and Geometric Independent Sets

Optimizing Quantum Compilers: Efficient and Effective Algorithms

Clustering and Informative Path Planning for 3D Gas Distribution Mapping: Algorithms and Performance Evaluation

A Lightweight Goal-Based model for Trajectory Prediction

Approximate CVPp in time 2(0.802n)

Mapping forest in the Swiss Alps treeline ecotone with explainable deep learning

Equivalence Checking for Orthocomplemented Bisemilattices in Log-Linear Time

Efficient Preparation of Cyclic Quantum States

Formula Normalizations in Verification

Faster Monotone Min-Plus Product, Range Mode, and Single Source Replacement Paths

A (2+epsilon)-Approximation Algorithm for Preemptive Weighted Flow Time on a Single Machine

Bayesian Decision Making in Groups is Hard

Learning convergence prediction of astrobots in multi-object spectrographs

On the adjustment, calibration and orientation of drone photogrammetry and laser-scanning

New Results in Integer and Lattice Programming

SAT-Based Exact Synthesis: Encodings, Topology Families, and Parallelism

Data Structures and Algorithms for Logic Synthesis in Advanced Technologies