Sciweavers

306 search results - page 7 / 62
» Constructive analysis, types and exact real numbers
Sort
View
WEBI
2004
Springer
14 years 25 days ago
Type-Based Composition of Information Services in Large Scale Environments
Service matchmaking and composition has recently drawn increasing attention in the research community. Most existing algorithms construct chains of services based on exact matches...
Ion Constantinescu, Boi Faltings, Walter Binder
ICWS
2004
IEEE
13 years 9 months ago
Large Scale, Type-Compatible Service Composition
Service matchmaking and composition has recently drawn increasing attention in the research community. Most existing algorithms construct chains of services based on exact matches...
Ion Constantinescu, Boi Faltings, Walter Binder
COMPGEOM
2004
ACM
14 years 28 days ago
Inner and outer rounding of set operations on lattice polygonal regions
Robustness problems due to the substitution of the exact computation on real numbers by the rounded floating point arithmetic are often an obstacle to obtain practical implementa...
Olivier Devillers, Philippe Guigue
MOC
1998
64views more  MOC 1998»
13 years 7 months ago
Analysis of non-overlapping domain decomposition algorithms with inexact solves
In this paper we construct and analyze new non-overlapping domain decomposition preconditioners for the solution of second-order elliptic and parabolic boundary value problems. The...
James H. Bramble, Joseph E. Pasciak, Apostol T. Va...
ESA
2006
Springer
130views Algorithms» more  ESA 2006»
13 years 11 months ago
Robust, Generic and Efficient Construction of Envelopes of Surfaces in Three-Dimensional Spaces
Lower envelopes are fundamental structures in computational geometry, which have many applications, such as computing general Voronoi diagrams and performing hidden surface removal...
Michal Meyerovitch