Publications related to Best-first search

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

Optimizing the mitigation of epidemic spreading through targeted adoption of contact tracing apps

Andrea Santoro

The ongoing COVID-19 pandemic is the first epidemic in human history in which digital contact tracing has been deployed at a global scale. Tracking and quarantining all the contacts of individuals who test positive for a virus can help slow down an epidemi ...

AMER PHYSICAL SOC2022

A greedy and distributable approach to the Lexicographic Bottleneck Assignment Problem with conditions on exactness

Tony Alan Wood

Solving the Lexicographic Bottleneck Assignment Problem (LexBAP) typically relies on centralised computation with order complexity. We consider the Sequential Bottleneck Assignment Problem (SeqBAP), which yields a greedy solution to the LexBAP and discuss ...

Elsevier2022

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, Olivier Ruas

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

A comment on performance guarantees of a greedy algorithm for minimizing a supermodular set function on comatroid

Maryam Kamgarpour, Baiwei Guo, Orcun Karaca

We provide a counterexample to the performance guarantee obtained in the paper "Il'ev, V., Linker, N., 2006. Performance guarantees of a greedy algorithm for minimizing a supermodular set function on comatroid", which was published in Volume 171 of the Eur ...

ELSEVIER2021

MATHICSE Technical Report : 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 ...

MATHICSE2020

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

An Optimal Planning Framework to Deploy Self-Reconfigurable Modular Robots

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

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, Ilija Bogunovic, Slobodan Mitrovic

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

Best-first search

Graph Chatbot

Chat with Graph Search

Beyond Local Optimality of Buffer and Splitter Insertion for AQFP Circuits

Optimizing the mitigation of epidemic spreading through targeted adoption of contact tracing apps

A greedy and distributable approach to the Lexicographic Bottleneck Assignment Problem with conditions on exactness

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

Cluster-and-Conquer: When Randomness Meets Graph Locality

A comment on performance guarantees of a greedy algorithm for minimizing a supermodular set function on comatroid

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

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

An Optimal Planning Framework to Deploy Self-Reconfigurable Modular Robots

Robust Submodular Maximization: A Non-Uniform Partitioning Approach

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

Optimizing the mitigation of epidemic spreading through targeted adoption of contact tracing apps

A greedy and distributable approach to the Lexicographic Bottleneck Assignment Problem with conditions on exactness

Cluster-and-Conquer: When Randomness Meets Graph Locality

An Optimal Planning Framework to Deploy Self-Reconfigurable Modular Robots

A comment on performance guarantees of a greedy algorithm for minimizing a supermodular set function on comatroid

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

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

Beyond Local Optimality of Buffer and Splitter Insertion for AQFP Circuits

Robust Submodular Maximization: A Non-Uniform Partitioning Approach