1722 search results - page 158 / 345 » Variables in Concept Graphs |
108
click to vote
CORR
2011
Springer
14 years 1 months ago
2011
Springer
Although many algorithms have been designed to construct Bayesian network structures using different approaches and principles, they all employ only two methods: those based on i...
ENTCS
2008
14 years 9 months ago
2008
The well-known notion of critical pairs already allows a static conflict detection, which is important for all kinds of applications and already implemented in AGG. Unfortunately ...
111
click to vote
ADHOCNOW
2004
Springer
15 years 3 months ago
2004
Springer
Consider k particles, 1 red and k −1 white, chasing each other on the nodes of a graph G. If the red one catches one of the white, it “infects” it with its color. The newly ...
85
Voted
GECCO
2004
Springer
15 years 3 months ago
2004
Springer
A new graph-based evolutionary algorithm named “Genetic Network Programming, GNP” has been proposed. GNP represents its solutions as directed graph structures, which can improv...
GD
2005
Springer
15 years 3 months ago
2005
Springer
The crossing number of a graph is the minimum number of edge intersections in a plane drawing of a graph, where each intersection is counted separately. If instead we count the nu...