Stochastic Optimization of Sailing Trajectories in an America's Cup Race
Publications associées (106)
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.
Using optical sideband cooling, a micromechanical oscillator is cooled to a phonon occupancy below 10 phonons, corresponding to a probability of finding it in its quantum ground state more than 10% of the time. ...
Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2011
Breadth First Search (BFS) is a widely used approach for sampling large graphs. However, it has been empirically observed that BFS sampling is biased toward high-degree nodes, which may strongly affect the measurement results. In this paper, we quantify an ...
Institute of Electrical and Electronics Engineers2011
Despite of being quite similar (agreement) problems, 1-set agreement (consensus) and general k-set agreement require surprisingly different techniques for proving the impossibility in asynchronous systems with crash failures: Rather than the relatively sim ...
Polymer therapeutics, including polymeric drugs and polymer-protein conjugates, are clinically established as first-generation nanomedicines. Knowing that the coiled-coil peptide motif is fundamentally important in the regulation of many cellular and patho ...
This paper presents an approach for model identifiability that builds upon recent research into measurement data interpretation. The objective of this approach is to determine probabilistically to what degree the number of models able to explain a measured ...
In this thesis, we try to treat the problem of oriented paths in n-chromatic digraphs. We first treat the case of antidirected paths in 5-chromatic digraphs, where we explain El-Sahili’s theorem and provide an elementary and shorter proof of it. We then tr ...
The automated inference of quantified invariants is considered one of the next challenges in software verification. The question of the right precision-efficiency tradeoff for the corresponding program analyses here boils down to the question of the right ...
Recently, Byrka, Grandoni, RothvoBand Sanita gave a 1.39 approximation for the Steiner tree problem, using a hypergraph-based linear programming relaxation. They also upper-bounded its integrality gap by 1.55. We describe a shorter proof of the same integr ...
We address the maximization of a project’s expected net present value when the activity durations and cash flows are described by a discrete set of alternative scenarios with associated occurrence probabilities. In this setting, the choice of scenario-inde ...