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.
We present a deterministic (1+root 5/2)-approximation algorithm for the s-t path TSP for an arbitrary metric. Given a symmetric metric cost on n vertices including two prespecified endpoints, the problem is to find a shortest Hamiltonian path between the t ...
Devices and methods for dividing droplets are generally described. In some embodiments, an article may comprise a fluidic channel comprising an array of obstructions. In certain embodiments, the arrangement of obstructions in the array may affect the flow ...
In the field of robust optimization, the goal is to provide solutions to combinatorial problems that hedge against variations of the numerical parameters. This constitutes an effort to design algorithms that are applicable in the presence of uncertainty in ...
This paper presents a low power successive approximation register (SAR) ADC and its front-end automatic gain control (AGC) amplifier designed in 65nm CMOS technology. Digitally controlled variable gain amplifier (VGA) in AGC loop is used to maximize the dy ...
The vertex cover problem is one of the most important and intensively studied combinatorial optimization problems. Khot and Regevproved that the problem is NP-hard to approximate within a factor2 - ∈, assuming the Unique Games Conjecture (UGC). This is tig ...
The optimal design of successive approximation register (SAR) analog-to-digital converters (ADCs) requires the accurate estimate of nonlinearity and parasitic capacitance effects in the feedback charge-redistribution digital-to-analog converters (DACs). Si ...
Many real-world systems are intrinsically nonlinear. This thesis proposes various algorithms for designing control laws for input-affine single-input nonlinear systems. These algorithms, which are based on the concept of quotients used in nonlinear control ...
Evolutionary algorithms were proposed to automatically find solutions to computational problems, much like evolution discovers new adaptive traits. Lately, they have been used to address challenging questions about the evolution of modularity, the genetic ...
We obtain a 1.5-approximation algorithm for the metric uncapacitated facility location problem (UFL), which improves on the previously best known 1.52-approximation algorithm by Mahdian, Ye and Zhang. Note, that the approximability lower bound by Guha and ...
A low power 2.4-GHz receiver exploiting the intrinsic high quality factor (Q) of Bulk Acoustic Wave (BAW) resonators is presented. A novel way of performing simple integer division of the BAW digitally controlled oscillator (DCO) signal to address multi-ch ...