197 search results - page 22 / 40 » Some Topological Methods in Graph Coloring Theory |
ENTCS
2008
13 years 8 months ago
2008
This paper describes a set of methods for randomly drawing traces in large models either uniformly among all traces, or with a coverage criterion as target. Classical random walk ...
SAC
2006
ACM
14 years 2 months ago
2006
ACM
We propose a geometric constraint solving method based on connectivity analysis in graph theory, which can be used to decompose a well-constrained problem into some smaller ones i...
MICCAI
2005
Springer
14 years 9 months ago
2005
Springer
This paper introduces a novel solver, namely cross entropy (CE), into the MRF theory for medical image segmentation. The solver, which is based on the theory of rare event simulati...
AI
2011
Springer
13 years 3 months ago
2011
Springer
This paper describes our methodology for building conformant planners, which is based on recent advances in the theory of action and change and answer set programming. The develop...
CORR
2011
Springer
13 years 7 days 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...