630 search results - page 59 / 126 » Symbolic Domain Decomposition |
IJCAI
1989
15 years 1 months ago
1989
Cognitive architectures aspire for generality both in terms of problem solving and learning across a range of problems, yet to date few examples of domain independent learning has...
MKM
2005
Springer
15 years 5 months ago
2005
Springer
Abstract. Many processes in mathematical computing try to use knowledge of the most desired forms of mathematical expressions. This occurs, for example, in symbolic computation sys...
100
click to vote
LICS
2003
IEEE
15 years 5 months ago
2003
IEEE
We show that the first-order theory of structural subtyping of non-recursive types is decidable, as a consequence of a more general result on the decidability of term powers of d...
VIS
2007
IEEE
16 years 1 months ago
2007
IEEE
The Morse-Smale complex is an efficient representation of the gradient behavior of a scalar function, and critical points paired by the complex identify topological features and th...
LSSC
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. In this study, the topics of grid generation and FEM applications are studied together following their natural synergy. We consider the following three grid generators: N...