A Fast TCAD-based Methodology for Variation Analysis of Emerging Nano-Devices
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.
This paper addresses the problem of designing an efficient implementation of a basic atomic read-write data structure over an asynchronous message-passing system. In particular, we consider time-efficient implementations of this abstraction in the case of ...
This paper describes a model for simulating crowds of humans in real time. We deal with a hierarchy composed of virtual crowds, groups, and individuals. The groups are the most complex structure that can be controlled in different degrees of autonomy. This ...
Institute of Electrical and Electronics Engineers Computer Society2001
This paper proposes a paradigm for specification of virtual human agents` level of autonomy. The idea we present in this paper aims at optimising the required complexity of agents in order to perform realistic simulations. The paradigm is based on the dist ...
The iterated difference of polyhedra V=P1\(P2\(...Pk)...) has been proposed independently in [Zwie-Aart-Wess92] and [Shon93] as a sufficient condition for V to be exactly computable by a two-layered neural network. An al ...
The iterated difference of polyhedra V=P1\(P2\(...Pk)...) has been proposed independently in [Zwie-Aart-Wess92] and [Shon93] as a sufficient condition for V to be exactly computable by a two-layered neural network. An al ...
Many reliable distributed systems are consensus-based and typically operate under two modes: a fast normal mode in failure-free periods, and a slower recovery mode following failures. A lot of work has been devoted to optimizing the normal mode, but little ...
The bridging of different research disciplines such as computer modelling and design practice requires full understanding of both. Privileging one area of investigation while simplifying the other is not a feasible option. This approach is likely to produc ...
This paper investigates the time-complexity of the non-blocking atomic commit (NBAC) problem in a synchronous distributed model where t out of n processes may fail by crashing. We exhibit for t > 3 an inherent trade-off between the fast abort property of N ...
This paper establishes the first theorem relating resilience, round complexity and authentication in distributed computing. We give an exact measure of the time complexity of consensus algorithms that tolerate Byzantine failures and arbitrary long periods ...
This paper describes a model for simulating crowds of humans in real time. We deal with a hierarchy composed of virtual crowds, groups and individuals. The groups are the most complex structure that can be controlled in different degrees of autonomy. This ...
