601 search results - page 89 / 121 » Edge-dominating cycles in graphs |
CORR
2007
Springer
13 years 8 months ago
2007
Springer
— Max-product belief propagation is a local, iterative algorithm to find the mode/MAP estimate of a probability distribution. While it has been successfully employed in a wide v...
ENTCS
2007
13 years 8 months ago
2007
The dependency pairs method is one of the most powerful technique for proving termination of rewriting and it is currently central in most automatic termination provers. Recently,...
CEC
2008
IEEE
14 years 3 months ago
2008
IEEE
Abstract— This paper presents a genetic algorithmic approach for finding efficient paths in directed graphs when optimizing multiple objectives. Its aim is to provide solutions...
GD
2009
Springer
14 years 1 months ago
2009
Springer
In this paper, we explore a new convention for drawing graphs, the (Manhattan-) geodesic drawing convention. It requires that edges are drawn as interior-disjoint monotone chains o...
CASCON
1997
13 years 10 months ago
1997
Often, software architects impose a particular style on the software systems they design. For large software systems, they would like to ensure that the design continues to confor...