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 propose a novel stochastic optimization algorithm, hybrid simulated annealing (SA), to train hidden Markov models (HMMs) for visual speech recognition. In our algorithm, SA is combined with a local optimization operator that substitutes a better solutio ...
In this paper we focus on the application of global stochastic optimization methods to extremum estimators. We propose a general stochastic method the master method which includes several stochastic optimization algorithms as a particular case. The propose ...
We aim at the elaboration of Information Systems able to optimize energy consumption in buildings while preserving human comfort. Our focus is in the use of state-based stochastic modeling applied to temporal signals acquired from heterogeneous sources suc ...
EPFL Solar Energy and Building Physics Laboratory (LESO-PB)2013
Today's supply networks consist of a certain amount of logistics objects that are enabled to interact with each other and to decide autonomously upon their next steps: in other words, they exhibit a certain degree of autonomous cooperation. Therefore, mode ...
In many situations, agents optimize their own operations locally but their local problems are interdependent. We consider the problem of coordinating these local problems to find a globally optimal solution. We model the coordination problem as a Distribut ...
Evaluative techniques offer a tremendous potential for on-line controller design. However, when the optimization space is large and the performance metric is noisy, the time needed to properly evaluate candidate solutions becomes prohibitively large and, a ...
Today's supply networks consist of a certain amount of logistics objects that are enabled to interact with each other and to decide autonomously upon their next steps: in other words, they exhibit a certain degree of autonomous cooperation. Therefore, mode ...
In cooperative multiagent systems, agents interact to solve tasks. Global dynamics of multiagent teams result from local agent interactions, and are complex and difficult to predict. Evolutionary computation has proven a promising approach to the design of ...
This is a comment on a recent paper by A. Hagberg and D. A. Schult [Chaos 18, 037105 (2008)]. By taking the eigenratio of the Laplacian of an undirected and unweighted network as its synchronizability measure, they proposed a greedy rewiring algorithm for ...
Combinatorial optimization problems in the real world are ubiquitous. Practical applications include planning, scheduling, distributed control, resource allocation, etc. These problems often involve multiple agents and can be formulated as a Multi-agent Co ...
