In this article, Temperley's bijection between spanning trees of the square grid on the one hand, and perfect matchings (also known as dimer coverings) of the square grid on ...
Richard Kenyon, James Gary Propp, David Bruce Wils...
We introduce exponential search trees as a novel technique for converting static polynomial space search structures for ordered sets into fully-dynamic linear space data structure...
—This article describes a rigorous and complete framework for the simultaneous localization and map building problem for mobile robots: the symmetries and perturbations map (SPma...
Tree models are valuable tools for predictive modeling and data mining. Traditional tree-growing methodologies such as CART are known to suffer from problems including greediness,...
In designing a state space of possible designs is implied by the representation used and the computational processes that operate on that representation. GAs are a means of effect...