Minimum Cost Intervention Design for Causal Effect Identification
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.
We show how to express an arbitrary integer interval I=[0,H] as a sumset I=∑i=1ℓGi∗[0,u−1]+[0,H′] of smaller integer intervals for some small values ℓ, u, and H′<u−1, where b∗A={ba:a∈A} and $A + B = ...
A recent internet based survey of over 35'000 samples has shown that when different human observers are asked to assign labels to static human facial expressions, different individuals categorize differently the same image. This fact results in a lack of a ...
Farmers in developing countries will in the future be confronted with major changes. The ability to cope with these challenges rests on their capability to relate future problems to current behavior. Our approach investigates this capability and consists i ...
A general (rectangular) partition is a partition of a rectangle into an arbitrary number of non-overlapping subrectangles. This paper examines vertex 4-colorings of general partitions where every subrectangle is required to have all four colors appear on i ...
The goal of this project is to develop a new heuristic for pseudo-tree regeneration in S-DPOP. S-DPOP is a version of DPOP which should show performance improvements when resolving problems after small changes. Examples of such problems are: tracking movin ...
In periodic scheduling jobs arrive regularly and have to be executed on one or several machines or processors. An enormous amount of literature has been published on this topic, e.g. the founding work of Liu & Layland [LL73] is among the top cited computer ...
OBJECTIVE: Adaptation to prisms displacing the visual scene rightward is a therapeutic tool for left unilateral spatial neglect (USN). We aimed at comparing the effects of the classic adaptation procedure (repeated pointing toward visual targets, control t ...
This paper considers a production planning problem in disassembly systems, which is the problem of determining the quantity and timing of disassembling end-of-use/life products in order to satisfy the demand of their parts or components over a planning hor ...
A binary tanglegram is a pair (S, T) of binary trees whose leaf sets are in one-to-one correspondence; matching leaves are connected by inter-tree edges. For applications, for example in phylogenetics, it is essential that both trees are drawn without edge ...
We revisit simultaneous diophantine approximation, a classical problem from the geometry of numbers which has many applications in algorithms and complexity. The input of the decision version of this problem consists of a rational vector \alpha, an error b ...
