Concept

State space search

Publications associées (39)

Efficient Massively Parallel Join Optimization for Large Queries

Anastasia Ailamaki, Bikash Chandra, Srinivas Karthik Venkatesh, Riccardo Mancini, Vasileios Mageirakos

Modern data analytical workloads often need to run queries over a large number of tables. An optimal query plan for such queries is crucial for being able to run these queries within acceptable time bounds. However, with queries involving many tables, find ...

2022

Continuous-Domain Formulation of Inverse Problems for Composite Sparse-Plus-Smooth Signals

Michaël Unser, Shayan Aziznejad, Thomas Jean Debarre

We present a novel framework for the reconstruction of 1D composite signals assumed to be a mixture of two additive components, one sparse and the other smooth, given a finite number of linear measurements. We formulate the reconstruction problem as a cont ...

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2021

Landmark Regularization: Ranking Guided Super-Net Training in Neural Architecture Search

Mathieu Salzmann, Kaicheng Yu

Weight sharing has become a de facto standard in neural architecture search because it enables the search to be done on commodity hardware. However, recent works have empirically shown a ranking disorder between the performance of stand-alone architectures ...

IEEE COMPUTER SOC2021

An Optimal-Storage Approach to Semidefinite Programming Using Approximate Complementarity

Volkan Cevher, Alp Yurtsever

This paper develops a new storage-optimal algorithm that provably solves almost all semidefinite programs (SDPs). This method is particularly effective for weakly constrained SDPs under appropriate regularity conditions. The key idea is to formulate an app ...

SIAM PUBLICATIONS2021

A Comparison of Greedy and Global Searches for Measurement-System Design in Bridge Load Testing

Ian Smith, Numa Joy Bertola

Due to conservative design models and safe construction practices, infrastructure often has significant yet-unknown reserve capacity that greatly exceeds code requirements. Reserve-capacity assessments lead to better asset-management decisions through eith ...

2019

Exact Synthesis of LTL Properties from Traces

Heinz Riener

We present an exact approach to synthesize temporal-logic formulas in linear temporal logic (LTL) from a set of given positive and negative example traces. Our approach uses topology structures, in particular partial DAGs, to partition the search space int ...

IEEE2019

Actuator Layout Optimization for Adaptive Structures Performing Large Shape Changes, Advanced Computing Strategies for Engineering

Ian Smith, Gennaro Senatore, Arka Prabhata Reksowardojo

Adaptive structures are sensed and actuated to modify internal forces and shape to maintain optimal performance in response to loads. The use of large shape changes as a structural adaptation strategy to counteract the effect of loads has been investigated ...

2018

Riemannian Optimization for Solving High-Dimensional Problems with Low-Rank Tensor Structure

Michael Maximilian Steinlechner

In this thesis, we present a Riemannian framework for the solution of high-dimensional optimization problems with an underlying low-rank tensor structure. Here, the high-dimensionality refers to the size of the search space, while the cost function is scal ...

EPFL2016

Memetic Viability Evolution for Constrained Optimization

Dario Floreano, Andrea Maesani, Giovanni Iacca

The performance of evolutionary algorithms can be heavily undermined when constraints limit the feasible areas of the search space. For instance, while Covariance Matrix Adapta- tion Evolution Strategy is one of the most efficient algorithms for unconstrai ...

Institute of Electrical and Electronics Engineers2016

Optimization of a Vircator using a novel evolutionary algorithm designed to reducing the number of evaluations

This paper presents an optimization of a virtual cathode oscillator (Vircator) with axial extraction using a novel evolutionary algorithm (EA) thought to reduce the number of evaluations. The EA was tested on a Vircator optimization with two objective func ...

IEEE2015

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.

Connectez-vous pour utiliser Chat avec Graph Search