Mediaspace scheduled maintenance: Aug 25, 2026 07:00 - 12:00 AM. During this time, videos will be temporarily unavailable. Check status updates.

Concept

Best-first search

Related publications (22)

Beyond Local Optimality of Buffer and Splitter Insertion for AQFP Circuits

Giovanni De Micheli, Heinz Riener, Siang-Yun Lee

Adiabatic quantum-flux parametron (AQFP) is an energy-efficient superconducting technology. Buffer and splitter (B/S) cells must be inserted to an AQFP circuit to meet the technology-imposed constraints on path balancing and fanout branching. These cells a ...

ACM2022

Frequency-Domain Non-intrusive Greedy Model Order Reduction Based on Minimal Rational Approximation

Fabio Nobile, Davide Pradovera

We present a technique for Model Order Reduction (MOR) of frequency-domain problems relying on rational interpolation of vector-valued functions. The selection of the sample points is carried out adaptively according to a greedy procedure. We describe seve ...

SPRINGER INTERNATIONAL PUBLISHING AG2021

Cluster-and-Conquer: When Randomness Meets Graph Locality

Anne-Marie Kermarrec

K-Nearest-Neighbors (KNN) graphs are central to many emblematic data mining and machine-learning applications. Some of the most efficient KNN graph algorithms are incremental and local: they start from a random graph, which they incrementally improve by tr ...

IEEE COMPUTER SOC2021

MATHICSE Technical Report : Frequency-domain non-intrusive greedy Model Order Reduction based on minimal rational approximation

Fabio Nobile, Davide Pradovera

MATHICSE2020

An Optimal Planning Framework to Deploy Self-Reconfigurable Modular Robots

Auke Ijspeert, Mehmet Hasan Mutlu, Simon Lukas Hauser, Alexandre Bernardino, Hala Khodr

Self-reconfiguration is a hard problem due to the high dimensionality of self-reconfigurable modular systems. Searchbased approaches offer complete and optimal solutions. However, naive search algorithms cannot directly solve self-reconfiguration tasks in ...

2019

Robust Submodular Maximization: A Non-Uniform Partitioning Approach

Volkan Cevher, Jonathan Mark Scarlett, Slobodan Mitrovic, Ilija Bogunovic

We study the problem of maximizing a monotone submodular function subject to a cardinality constraint

k

, with the added twist that a number of items

\tau

from the returned set may be removed. We focus on the worst-case setting considered in Orlin et al ...

2017

Heuristic Description of Magnetoelectricity of Cu2OSeO3

Helmuth Berger

CuO2SeO3 is an insulating material that hosts topologically nontrivial spin whirls, so-called skyrmions, and exhibits magnetoelectric coupling allowing to manipulate these skyrmions by means of electric fields. We report magnetic force microscopy imaging o ...

Amer Chemical Soc2016

BluePyOpt: Leveraging Open Source Software and Cloud Infrastructure to Optimise Model Parameters in Neuroscience

Henry Markram, Felix Schürmann, Eilif Benjamin Muller, Idan Segev, Werner Alfons Hilda Van Geit, Jean-Denis Georges Emile Courcol, Giuseppe Chindemi, Michael Emiel Gevaert

At many scales in neuroscience, appropriate mathematical models take the form of complex dynamical systems. Parametrising such models to conform to the multitude of available experimental constraints is a global nonlinear optimisation problem with a comple ...

Frontiers Research Foundation2016

Improving the efficiency of branch-and-bound complete-search NMR assignment using the symmetry of molecules and spectra

Luc Patiny, Julien Wist

Nuclear magnetic resonance (NMR) assignment of small molecules is presented as a typical example of a combinatorial optimization problem in chemical physics. Three strategies that help improve the efficiency of solution search by the branch and bound metho ...

Amer Inst Physics2015

Non-Rigid Graph Registration using Active Testing Search

Pascal Fua, Raphael Sznitman, Jan Kybic

We present a new approach for matching sets of branching curvilinear structures that form graphs embedded in R2 or R3 and may be subject to deformations. Unlike earlier methods, ours does not rely on local appearance similarity nor does require a good init ...

Institute of Electrical and Electronics Engineers2015

Sparse Group Covers and Greedy Tree Approximations

Volkan Cevher, Luca Baldassarre

We consider the problem of finding a K-sparse approximation of a signal, such that the support of the approximation is the union of sets from a given collection, a.k.a. group structure. This problem subsumes the one of finding K-sparse tree approximations. ...

2015

Efficient greedy algorithms for high-dimensional parameter spaces with applications to empirical interpolation and reduced basis methods

Jan Sickmann Hesthaven, Benjamin Stamm

We propose two new and enhanced algorithms for greedy sampling of high- dimensional functions. While the techniques have a substantial degree of generality, we frame the discussion in the context of methods for empirical interpolation and the devel- opment ...

EDP Sciences2014

Buffer optimization based on critical path analysis of a dataflow program design

Marco Mattavelli, Simone Casale Brunet

The trade-off between throughput and memory constraints is a common design problem in embedded systems, and especially for streaming applications, where the memory in question usually occurs in the form of buffers for streams of data. This paper presents a ...

IEEE2013

Heuristic algorithms for minimising total recovery cost of end-of-life products under quality constraints

Dimitrios Kyritsis

Recently, the optimisation of end-of-life (EOL) product recovery processes has been highlighted. At the inspection phase after disassembly, each part can have various recovery options such as reuse, reconditioning, remanufacturing, and disposal. Depending ...

Taylor & Francis Ltd2012

SCOOP: A Real-Time Sparsity Driven People Localization Algorithm

Pierre Vandergheynst, Alexandre Massoud Alahi, Mohammad Golbabaee

Detecting and tracking people in scenes monitored by cameras is an important step in many application scenarios such as surveillance, urban planning or behavioral studies to name a few. The amount of data produced by camera feeds is so large that it is als ...

Springer Verlag2012

Integration of Online Learning into HTN Planning for Robotic Tasks

Francesco Mondada, Jean-Cédric Chappelier, Stéphane Magnenat

This paper extends hierarchical task network (HTN) planning with lightweight learning, considering that in robotics, actions have a non-zero probability of failing. Our work applies to A*-based HTN planners with lifting. We prove that the planner finds the ...

2012

Multiple Object Tracking using K-Shortest Paths Optimization

Pascal Fua, François Fleuret, Engin Türetken

Multi-object tracking can be achieved by detecting objects in individual frames and then linking detections across frames. Such an approach can be made very robust to the occasional detection failure: If an object is not detected in a frame but is in previ ...

Institute of Electrical and Electronics Engineers2011

A decision support method for product conceptual design considering product lifecycle factors and resource constraints

Dimitrios Kyritsis, Paul Xirouchakis

In general, it is difficult to select a satisfactory product concept because the information in the early stage of design process is subjective, qualitative, and even uncertain to design engineers. The correlations among engineering characteristics for a p ...

Springer Verlag2011

Extended Navigability of Small World Networks: Exact Results and New Insights

Paolo De Los Rios

Navigability of networks, that is, the ability to find any given destination vertex starting from any other vertex, is crucial to their usefulness. In 2000 Kleinberg showed that optimal navigability could be achieved in small world networks provided that a ...

American Physical Society2009

Gene Expression Data Analysis Using a Novel Approach to Biclustering Combining Discrete and Continuous Data

Lei Zhang, Yann Christinat

Many different methods exist for pattern detection in gene expression data. In contrast to classical methods, biclustering has the ability to cluster a group of genes together with a group of conditions (replicates, set of patients, or drug compounds). How ...

2008