Concept

Decay theory

Related publications (11)

An instance-based learning approach for evaluating the perception of ride-hailing waiting time variability

Understanding user’s perception of service variability is essential to discern their overall perception of any type of (transport) service. We study the perception of waiting time variability for ride-hailing services. We carried out a stated preference su ...

2023

Decoupling the Contributions of Different Instability Mechanisms to the PEMFC Performance Decay of Non-noble Metal O2-Reduction Catalysts

Vasiliki Tileli, Robin Pierre Alain Girod, Secil Unsal

Non-noble metal catalysts (NNMCs) hold the potential to replace the expensive Pt-based materials currently used to speed up the oxygen reduction reaction (ORR) in proton exchange membrane fuel cell (PEMFC) cathodes, but they feature poor durability that in ...

AMER CHEMICAL SOC2023

System Support for Efficient Replication in Distributed Systems

Dragos-Adrian Seredinschi

Current online applications, such as search engines, social networks, or file sharing services, execute across a distributed network of machines. They provide non-stop services to their users despite failures in the underlying network. To achieve such a hi ...

EPFL2019

One-shot learning and eligibility traces in sequential decision making

Marco Philipp Lehmann

When humans or animals perform an action that led to a desired outcome, they show a tendency to repeat it. The mechanisms underlying learning from past experience and adapting future behavior are still not fully understood. In this thesis, I study how huma ...

EPFL2018

Evidence for eligibility traces in human learning

Michael Herzog, Wulfram Gerstner, Kerstin Preuschoff, Marco Philipp Lehmann, He Xu, Vasiliki Liakoni

Whether we prepare a coffee or navigate to a shop: in many tasks we make multiple decisions before reaching a goal. Learning such state-action sequences from sparse reward raises the problem of credit-assignment: which actions out of a long sequence should ...

arXiv2017

Time-Varying Gaussian Process Bandit Optimization

Volkan Cevher, Jonathan Mark Scarlett, Ilija Bogunovic

We consider the sequential Bayesian optimization problem with bandit feedback, adopting a formulation that allows for the reward function to vary with time. We model the reward function using a Gaussian process whose evolution obeys a simple Markov model. ...

2016

Atum: Scalable Group Communication Using Volatile Groups

Rachid Guerraoui, Anne-Marie Kermarrec, Dragos-Adrian Seredinschi, Matej Pavlovic

This paper presents Atum, a group communication middleware for a large, dynamic, and hostile environment. At the heart of Atum lies the novel concept of volatile groups: small, dynamic groups of nodes, each executing a state machine replication protocol, o ...

ACM Press2016

Limit Behaviour of the Voter Model, Exclusion Process and Regenerative Chains

Samuel Schöpfer

Though the following topics seem unlinked, most of the tools used in this thesis are related to random walks and renewal theory. After introducing the voter model, we consider the parabolic Anderson model with the voter model as catalyst. In GÄRTNER, DEN H ...

EPFL2012

KFM detection of quantified charges injected into a thin SiO2 layer containing Si nps embedded by ultra low energy ion implantation using stencil lithography

Jürgen Brugger, Andreea Veronica Savu, Marc Antonius Friedrich van den Boogaart

Non volatile flash memories based on nanoparticles (nps) are one of the identified routes to a further downscaling of future CMOS technology. New features such as Coulomb blockade and quantized charging effects can appear at room temperature only for a lim ...

2008

Navigation for digital actors based on synthetic vision, memory, and learning

Daniel Thalmann, Olivier Renault

The paper describes an animation approach where synthetic vision is used for navigation by a digital actor. The vision is the only channel of information between the actor and its environment and offers a universal approach to pass the necessary informatio ...

1995

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.