630 search results - page 98 / 126 » Symbolic Domain Decomposition |
COMPULOG
1999
Springer
14 years 23 days ago
1999
Springer
Many constraint satisfaction problems can be naturally and efficiently modelled using non-binary constraints like the “all-different” and “global cardinality” constraints...
HPCN
1998
Springer
14 years 21 days ago
1998
Springer
Unstructured grids can represent the complex geometry of the ocean basin with high delity. The lack of development tools supporting irregular grid problems discourages the use of ...
EUROGP
2007
Springer
14 years 11 days ago
2007
Springer
The conversion and extension of the Incremental Pareto-Coevolution Archive algorithm (IPCA) into the domain of Genetic Programming classification is presented. In particular, the ...
CP
2006
Springer
14 years 6 days ago
2006
Springer
Abstract. The constraint satisfaction problem can be solved in polynomial time for instances where certain parameters (e.g., the treewidth of primal graphs) are bounded. However, t...
CVRMED
1995
Springer
14 years 1 days ago
1995
Springer
This paper presents a technique for the segmentation of anatomic structures in medical images using a topologically adaptable snakes model. The model is set in the framework of dom...