Barrier trees are a convenient way of representing the structure of complex combinatorial landscapes over graphs. Here we generalize the concept of barrier trees to landscapes deļ...
This paper presents an approach to produce generalization candidates for a concept hierarchy without the necessity of being an expert in the domain to be generalized and ...
Abstract. Random intersection graphs (RIGs) are an important random structure with algorithmic applications in social networks, epidemic networks, blog readership, and wireless sen...
Milan Bradonjic, Aric A. Hagberg, Nicolas W. Henga...
A General Game Playing System is one that can accept a formal description of a game and play the game effectively without human intervention. Unlike specialized game players, such...
Michael R. Genesereth, Nathaniel Love, Barney Pell
Abstract. This paper investigates the use of a total least squares approach in a generalization of the iterative closest point (ICP) algorithm for shape registration. A new General...