Concept

Exploration

Publications associées (6)

Seeking the new, learning from the unexpected: Computational models of surprise and novelty in the brain

Human babies have a natural desire to interact with new toys and objects, through which they learn how the world around them works, e.g., that glass shatters when dropped, but a rubber ball does not. When their predictions are proven incorrect, such as whe ...

EPFL2024

Motivating Innovation: The Effect of Loss Aversion on the Willingness to Persist

Kenneth Younge

We investigate the willingness of individuals to persist at exploration in the face of failure. Prior research suggests that the organization's "tolerance for failure" may motivate greater exploration by the individual. Little is known, however, about how ...

MIT Press2020

Collaborative Web-GIS platform for systematic exploration of Lake Geneva

Ulrich Lemmin, Yosef Akhtman, Lorenzo Martelletti, Olga Grandjean

We have developed and deployed a Web-based GIS data management framework, which facilitates an effective and highly structured search, retrieval and visualisation of multi-modal scientific data, as well as its subsequent dissemination in multiple and stand ...

ISPRS2012

Gradient estimates of return

Samy Bengio, Christos Dimitrakakis

The exploration-exploitation trade-off that arises when one considers simple point estimates of expected returns no longer appears when full distributions are considered. This work develops a simple gradient-based approach for mainting such distributions a ...

IDIAP2005

Age Matters: Efficient Route Discovery in Mobile Ad Hoc Networks Using Encounter Ages

Martin Vetterli, Matthias Grossglauser, Henri Julien Dubois-Ferrière

We propose FResher Encounter SearcH (FRESH), a simple algorithm for efficient route discovery in mobile ad hoc networks. Nodes keep a record of their most recent encounter times with all other nodes. Instead of searching for the destination, the source nod ...

2003

Age Matters: Efficient Route Discovery in Mobile Ad Hoc Networks Using Encounter Ages

Martin Vetterli, Matthias Grossglauser, Henri Julien Dubois-Ferrière

2003

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