Concept

Capital punishment in the United States

Related publications (16)

Graph Chatbot

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.

In materials, the evolution of crack surfaces is intimately linked with the self-contact occurring between them. The developed contact forces not only mitigate the effect of stress concentration at crack tip but also contribute sig- nificantly to the trans ...

2021

Coupling between cohesive element method and Node-to-segment contact algorithm : Implementation and application

Guillaume Anciaux, Mohit Pundir

In materials, the evolution of crack surfaces is intimately linked with the self-contact occuring between them. The developed contact forces not only mitigate the effect of stress concentration at crack tip but also contribute significantly to the transfer ...

2021

, ,

SAT-sweeping is a powerful method for simplifying logic networks. It consists of merging gates that are proven equivalent (up to complementation) by running simulation and SAT solving in synergy. SAT-sweeping is used in both verification and synthesis appl ...

IEEE2020

SAT-Sweeping Enhanced for Logic Synthesis

Giovanni De Micheli, Luca Gaetano Amarù, Eleonora Testa

IEEE2020

Distributed Coupled Learning Over Adaptive Networks

Ali H. Sayed, Sulaiman A S A E Alghunaim

This work develops an effective distributed algorithm for the solution of stochastic optimization problems that involve partial coupling among both local constraints and local cost functions. While the collection of networked agents is interested in discov ...

IEEE2018

High-Precision Performance Estimation for the Design Space Exploration of Dynamic Dataflow Programs

Marco Mattavelli, Simone Casale Brunet, Endri Bezati, Malgorzata Maria Michalska

The implementation and optimization of dynamic dataflow programs on multi/many-core platforms require solving a very difficult problem: how to partition and schedule the processing elements and dimension their interconnecting buffers according to given opt ...

2018

The Complexity of Reliable and Secure Distributed Transactions

Junxiong Wang

The use of transactions in distributed systems dates back to the 70's. The last decade has also seen the proliferation of transactional systems. In the existing transactional systems, many protocols employ a centralized approach in executing a distributed ...

EPFL2018

, , , , , ,

For several reasons the challenge to keep the loads to the first wall within engineering limits is substantially higher in DEMO compared to ITER. Therefore the pre-conceptual design development for DEMO that is currently ongoing in Europe needs to be based ...

2017

From Massive Parallelization to Quantum Computing: Seven Novel Approaches to Query Optimization

Immanuel Trummer

The goal of query optimization is to map a declarative query (describing data to generate) to a query plan (describing how to generate the data) with optimal execution cost. Query optimization is required to support declarative query interfaces. It is a co ...

EPFL2016

Serotonergic neurons signal reward and punishment on multiple timescales

Serotonin's function in the brain is unclear. One challenge in testing the numerous hypotheses about serotonin's function has been observing the activity of identified serotonergic neurons in animals engaged in behavioral tasks. We recorded the activity of ...

2015