Search results for "Search tree"

Panel Summary: Planning and Problem Solving

1999

I will sketch some ideas that have guided the psychological approaches to problem solving. Traditionally, psychologists have considered the ability to solve problems “one of the most important manifestations of human thinking”. 1 Moreover, “problem” has been defined as a search that starts when we have a goal, but our habitual means are not sufficient to achieve it.

Right-arm rotation distance between binary trees

2003

We consider a transformation on binary trees, named right-arm rotation, which is a special instance of the well-known rotation transformation. Only rotations at nodes of the right arm of the trees are allowed. Using ordinal tools, we give an efficient algorithm for computing the right-arm rotation distance between two binary trees, i.e., the minimum number of rightarm rotations necessary to transform one tree into the other.

Short notes: Some Properties of the Rotation Lattice of Binary Trees

1988

On the Bias of Syntactic Geometric Recombination in Genetic Programming and Grammatical Evolution

2015

For fixed-length binary representations as used in genetic algorithms, standard recombination operators (e.g.,~one-point crossover) are unbiased. Thus, the application of recombination only reshuffles the alleles and does not change the statistical properties in the population. Using a geometric view on recombination operators, most search operators for fixed-length strings are geometric, which means that the distances between offspring and their parents are less than, or equal to, the distance between their parents. In genetic programming (GP) and grammatical evolution (GE), the situation is different since the recombination operators are applied to variable-length structures. Thus, most r…

Analyse multirésolution pour la recherche et l'indexation d'images par le contenu dans les bases de données images - Application à la base d'images p…

2005

Recent content-based image retrieval systems offer an interactive visual browsing of images databases. These methods perform a classification of images (offline) into a search tree for users browsing (online). This approach shows three main problems:1) The size of decriptor vector (n>100) makes distance computing sensitive to dimensionality curse,2) Having many different kinds of attributes into descriptor vector does not help classification,3) In general, classification does not take in consideration users' search context. In this work, we propose a method based on building hierarchical signatures having small increasing sizes, this allows to take users' search context into consideration. …

Recursion at the crossroads of sequence modeling, random trees, stochastic algorithms and martingales

2013

This monograph synthesizes several studies spanning from dynamical systems in the statistical analysis of sequences, to analysis of algorithms in random trees and discrete stochastic processes. These works find applications in various fields ranging from biological sequences to linear regression models, branching processes, through functional statistics and estimates of risk indicators for insurances. All the established results use, in one way or another, the recursive property of the structure under study, by highlighting invariants such as martingales, which are at the heart of this monograph, as tools as well as objects of study.