Concept

Best-first search

Related publications (51)

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.

Weighted A* search - unifying view and application

The A* algorithm is a well-known heuristic best-first search method. Several performance-accelerated extensions of the exact A* approach are known. Interesting examples are approximate algorithms where the heuristic function used is inflated by a weight (o ...

2009

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

Paolo De Los Rios, Cécile Caretta Cartozo

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

Multiple Object Tracking using Flow Linear Programming

Pascal Fua, François Fleuret, Jérôme Berclaz

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 ...

2009

Multiple Object Tracking using Flow Linear Programming

Pascal Fua, François Fleuret, Jérôme Berclaz

Multi-object tracking can be achieved by detecting objects in individ- ual 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 pre ...

Idiap2009

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

Survey Propagation Inspired Algorithms for Satisfiability

Nicolas Macris, Shrinivas Kudekar

In this note we develop generalized Survey Propagation (SP) equations from the cavity method. We quantize the message space of the messages to develop a message passing rule. We investigate a framework of greedy algorithms for finding out satisfying assign ...

2008

Dictionary preconditioning for greedy algorithms

Pierre Vandergheynst, Karin Schnass

This article presents an alteration of greedy algorithms like thresholding or (Orthogonal) Matching Pursuit which improves their performance in finding sparse signal representations in redundant dictionaries. These algorithms can be split into a sensing an ...

2008

Discrete choice models and heuristics for global nonlinear optimization

Michel Bierlaire

The lecture will consist in two parts. First, recent advances in discrete choice models will be presented and motivated. The estimation of these advanced models involves the maximization of a nonlinear, nonconcave loglikelihood function. The nonconcavity o ...

2007

Stationary Features and Cat Detection

François Fleuret

Most discriminative techniques for detecting instances from object categories in still images consist of looping over a partition of a pose space with dedicated binary classifiers. The efficiency of this strategy for a complex pose, i.e., for fine-grained ...

IDIAP2007

Measurement system design using damage scenarios

Ian Smith, Sandro Saitta

This paper presents a measurement system design methodology that incorporates damage scenarios. One of the goals of a measurement system is to detect damage for safety and for management of maintenance activities. This study builds upon previous research a ...

2007