Concept

Longest common subsequence

Related publications (8)

Enhancing general spatial skills of young visually impaired people with a programmable distance discrimination training: a case control study

Background The estimation of relative distance is a perceptual task used extensively in everyday life. This important skill suffers from biases that may be more pronounced when estimation is based on haptics. This is especially true for the blind and visua ...

BMC2019

Analysis of lightning-ionosphere interaction using simultaneous records of source current and 380 km distant electric field

Mario Paolone, Marcos Rubinstein, Mohammad Azadifar, Wolfgang Schulz, Davide Pavanello, Dongshuai Li

We present simultaneous current and wideband electric field waveforms at 380 km associated with upward lightning flashes initiated from the Santis Tower, Switzerland. To the best of our knowledge, the dataset presented in this study includes the first simu ...

Elsevier2017

Online Auctions for Dynamic Assignment: Theory and Empirical Evaluation

Boi Faltings, Sujit Prakash Gujar

Dynamic resource assignment is a common problem in multi-agent systems. We consider scenarios in which dynamic agents have preferences about assignments and the resources that can be assigned using online auctions. We study the trade-off between the follow ...

Ios Press2016

Evolution of whole genomes through inversions

Krister Swenson

Advances in sequencing technology are yielding DNA sequence data at an alarming rate – a rate reminiscent of Moore's law. Biologists' abilities to analyze this data, however, have not kept pace. On the other hand, the discrete and mechanical nature of the ...

EPFL2009

Recent Advances in Dynamic, Distributed Constraint Optimization

Adrian Petcu

Constraint satisfaction/optimization is a powerful paradigm for solving numerous tasks in distributed AI, including planning, scheduling and resource allocation. However, up to now, distributed algorithms for constraint reasoning (especially optimization) ...

2006

Global Solution of Mixed-Integer Dynamic Optimization Problems

Benoît Chachuat

This paper presents a decomposition approach for a quite general class of mixed-integer dynamic optimization problems that is capable of guaranteeing a global solution despite the nonconvexities inherent to the dynamic optimization subproblems. A case stud ...

Elsevier2005

Global mixed-integer dynamic optimization

Benoît Chachuat

Recent advances in process synthesis, design, operations, and control have created an increasing demand for efficient numerical algorithms for optimizing a dynamic system coupled with discrete decisions; these problems are termed mixed-integer dynamic opti ...

2005

Global Solution of Mixed-Integer Dynamic Optimization Problems

Benoît Chachuat

This paper presents a decomposition approach for a quite general class of mixed- integer dynamic optimization problems that is capable of guaranteeing the global solution despite the nonconvexities inherent to the dynamic optimization subproblems. A case s ...

2004

Graph Chatbot

Chat with Graph Search

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.