Concept

Sémantique des modèles stables

Publications associées (11)

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

Imagine the Unseen World: A Benchmark for Systematic Generalization in Visual World Models

Caglar Gulcehre

Systematic compositionality, or the ability to adapt to novel situations by creating a mental model of the world using reusable pieces of knowledge, remains a significant challenge in machine learning. While there has been considerable progress in the lang ...

2023

Machine Learning Methods for Robust Uncertainty Quantification and Controller Approximation

Emilio Maddalena

This thesis is situated at the crossroads between machine learning and control engineering. Our contributions are both theoretical, through proposing a new uncertainty quantification methodology in a kernelized context; and experimental, through investigat ...

EPFL2023

Emergence of diauxie as an optimal growth strategy under resource allocation constraints in cellular metabolism

Vassily Hatzimanikatis, Pierre Guy Rémy Salvy

Diauxie, or the sequential consumption of carbohydrates in bacteria such as Escherichia coli, has been hypothesized to be an evolutionary strategy which allows the organism to maximize its instantaneous specific growth-giving the bacterium a competitive ad ...

NATL ACAD SCIENCES2021

Minimizing Human Effort in Reconciling Match Networks

Karl Aberer, Quoc Viet Hung Nguyen, Zoltán Miklós, Tri Kurniawan Wijaya

Schema and ontology matching is a process of establishing correspondences between schema attributes and ontology concepts, for the purpose of data integration. Various commercial and academic tools have been developed to support this task. These tools prov ...

2013

Qualitative Spatial and Temporal Reasoning with Answer Set Programming

Jingshi Li

Representing and reasoning spatial and temporal information is a key research issue in Computer Science and Artificial Intelligence. In this paper, we introduce tools that produce three novel encodings which translate problems in qualitative spatial and te ...

2012

Separating stable sets in claw-free graphs via Padberg-Rao and compact linear programs

Yuri Faenza, Gautier Stauffer

In this paper, we provide the first linear programming formulations for the stable set problem in claw-free graphs, together with polynomial time separation routines for those formulations (they are not compact). We then exploit one of those extended formu ...

2012

Deprecating the Observer Pattern

Martin Odersky, Tiark Rompf, Ingo Maier

Programming interactive systems by means of the observer pattern is hard and error-prone yet is still the implementation standard in many production environments. We present an approach to gradually deprecate observers in favor of reactive programming abst ...

2010

Probabilistic Weighted Automata

Laurent Doyen

Nondeterministic weighted automata are finite automata with numerical weights on transitions. They define quantitative languages

L

that assign to each word

w

a real number

L(w)

. The value of an infinite word

w

is computed as the maximal value of al ...

2009

Semantics of OCL specified with QVT

Slavisa Markovic

The Object Constraint Language (OCL) has been for many years formalized both in its syntax and semantics in the language standard. While the official definition of OCL's syntax is already widely accepted and strictly supported by most OCL tools, there is n ...

Springer-Verlag2008

From Liveness to Promptness

Liveness temporal properties state that something

good'' eventually happens, e.g., every request is eventually granted. In Linear Temporal Logic (LTL), there is no a priori bound on the

wait time'' for an eventually to be fulfilled. That is,

F\theta

...

2007