158 search results - page 15 / 32 » A Self-stabilizing Algorithm for Graph Searching in Trees |
CP
2000
Springer
15 years 1 months ago
2000
Springer
Abstract. Variable elimination is the basic step of Adaptive Consistency 4 . It transforms the problem into an equivalent one, having one less variable. Unfortunately, there are ma...
106
click to vote
WWW
2007
ACM
15 years 10 months ago
2007
ACM
Hierarchical models are commonly used to organize a Website's content. A Website's content structure can be represented by a topic hierarchy, a directed tree rooted at a...
101
click to vote
GECCO
2006
Springer
15 years 1 months ago
2006
Springer
In some cases, evolutionary algorithms represent individuals as typical binary trees with n leaves and n-1 internal nodes. When designing a crossover operator for a particular rep...
88
Voted
ALGORITHMICA
1998
14 years 9 months ago
1998
Mallows and Riordan showed in 1968 that labeled trees with a small number of inversions are related to labeled graphs that are connected and sparse. Wright enumerated sparse connec...
110
click to vote
CORR
2011
Springer
14 years 4 months ago
2011
Springer
In Artificial Intelligence with Coalition Structure Generation (CSG) one refers to those cooperative complex problems that require to find an optimal partition, maximising a soci...