204 search results - page 18 / 41 » Heuristics for Dynamically Adapting Propagation |
TMI
2002
13 years 7 months ago
2002
This paper presents a fully automated segmentation method for medical images. The goal is to localize and parameterize a variety of types of structure in these images for subsequen...
NIPS
2007
13 years 9 months ago
2007
Dynamic Bayesian networks are structured representations of stochastic processes. Despite their structure, exact inference in DBNs is generally intractable. One approach to approx...
LPNMR
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. Most complete answer set solvers are based on DPLL. One of the constraint propagation methods is the so-called lookahead, which has been somewhat controversial, due to it...
EUROGP
1999
Springer
14 years 3 hour ago
1999
Springer
Abstract We consider a form of phenotype plasticity in Genetic Programming (GP). This takes the form of a set of real-valued numerical parameters associated with each individual, a...
ADHOC
2007
13 years 7 months ago
2007
Abstract. Many ad hoc routing algorithms rely on broadcast flooding for location discovery or, more generally, for secure routing applications. Flooding is a robust algorithm but ...