Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

12

MFPS
1991

favoriteEmaildiscussreport

135views Programming Languages» more MFPS 1991»

Decomposition of Domains

13 years 8 months ago

Decomposition of Domains

Download homepages.inf.ed.ac.uk

The problem of decomposing domains into sensible factors is addressed and solved for the case of dI-domains. A decomposition theorem is proved which allows the represention of a large subclass of dI-domains in a product of at domains. Direct product decompositions of Scott-domains are studied separately.

Achim Jung, Leonid Libkin, Hermann Puhlmann

Real-time Traffic

Decomposition Theorem | Direct Product Decompositions | MFPS 1991 | Programming Languages | Sensible Factors |

claim paper

Related Content

» A domain decomposition method for the Oseenviscoelastic flow equations

» On a generalization of triangulated graphs for domains decomposition of CSPs

» Domain Decomposition Preconditioners for Multiscale Flows in HighContrast Media

» A 2level domain decomposition algorithm for inverse diffuse optical tomography

» An additive Schwarz method for variational inequalities

» Data Distribution Strategies for Domain Decomposition Applications in Grid Environments

» P3PC A PointtoPoint Communication Model for Automatic and Optimal Decomposition of Regular...

» Domain decomposition by radial basis functions for time dependent partial differential equ...

» Symbolic Domain Decomposition

Post Info
More Details (n/a)

Added	27 Aug 2010
Updated	27 Aug 2010
Type	Conference
Year	1991
Where	MFPS
Authors	Achim Jung, Leonid Libkin, Hermann Puhlmann

Comments (0)