Concept

Méthode de la chaîne critique

Publications associées (32)

Improving Circuit Mapping Performance Through MIG-based Synthesis for Carry Chains

Giovanni De Micheli, Paolo Ienne, Mathias Soeken, Grace Zgheib, Pierre-Emmanuel Julien Marc Gaillardon, Luca Gaetano Amarù, Xifan Tang, Ana Petkovska, Zhufei Chu

Hard-wired carry chains in FPGAs are designed to improve efficiency of important arithmetic primitives. Although they are proven to be effective for arithmetic-rich functions, there are very few studies on the optimization opportunities of carry chains for ...

ACM2017

Robust 3D Object Pose Estimation and Tracking from Monocular Images in Industrial Environments

Alberto Crivellaro

Recent advances in Computer Vision are changing our way of living and enabling new applications for both leisure and professional use. Regrettably, in many industrial domains the spread of state-of-the-art technologies is made challenging by the abundance ...

EPFL2016

Thermal Issues in Deep Sub-Micron FDSOI Circuits

Yusuf Leblebici, Can Baltaci

Self-heating effects became more prominent with the introduction of the modern devices like FDSOI and low thermal conductivity materials such as SiO2. Consequently, the design of high speed digital circuits which are the time-critical blocks of high perfor ...

Ieee2016

Interdiction Games on Markovian PERT Networks

Daniel Kuhn, Wolfram Wiesemann, Eli Gutin

In a stochastic interdiction game a proliferator aims to minimize the expected duration of a nuclear weapons development project, and an interdictor endeavors to maximize the project duration by delaying some of the project tasks. We formulate static and d ...

Informs2015

Automatic Generation of Inexact Digital Circuits by Gate-level Pruning

Christian Enz, Vincent Frédéric Camus, Jérémy Lucien Maurice Schlachter

Inexact or approximate circuits show great ability to reduce power consumption at the cost of occasional errors in comparison to their conventional counterparts. Even though the benefits of such circuits have been proven for many applications, they are not ...

2015

Robust resource allocations in temporal networks

Daniel Kuhn, Wolfram Wiesemann

Temporal networks describe workflows of time-consuming tasks whose processing order is constrained by precedence relations. In many cases, the durations of the network tasks can be influenced by the assignment of resources. This leads to the problem of sel ...

2012

Design of Energy Efficient and Dependable Health Monitoring Systems under Unreliable Nanometer Technologies

David Atienza Alonso, Andreas Peter Burg, Georgios Karakonstantis, Mohamed Mostafa Sabry Aly

In this paper we investigate the impact of potential hardware misbehavior induced by reliability issues and scaled voltages in wireless body sensor network (WBSN) nodes. Our study reveals the inherent resilience of popular algorithms in cardiac monitoring ...

ACM Press2012

Modeling and Design Techniques for 3-D ICs under Process, Voltage, and Temperature Variations

Hu Xu

Three-dimensional (3-D) integration is a promising solution to further enhance the density and performance of modern integrated circuits (ICs). In 3-D ICs, multiple dies (tiers or planes) are vertically stacked. These dies can be designed and fabricated se ...

EPFL2012

Low-Power Circuits and Systems Design for Data Acquisition and Transmission in a Wireless Cortical Implant

Vahid Majidzadeh Bafar

Minimally invasive monitoring of the electrical activity of specific cortical areas using implantable microsystems offers the promise of diagnosing neurological diseases, as well as detecting and identifying neural activity patterns which are specific to a ...

EPFL2012

Jet: An Embedded DSL for High Performance Big Data Processing

Martin Odersky, Tiark Rompf, Vojin Jovanovic, Stefan Ackermann

Cluster computing systems today impose a trade-off between generality, performance and productivity. Hadoop and Dryad force programmers to write low level programs that are tedious to compose but easy to optimize. Systems like Dryad/LINQ and Spark allow co ...

2012

Graph Chatbot

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.

Connectez-vous pour utiliser Chat avec Graph Search