Sciweavers

1208 search results - page 115 / 242
» Uniform eventown problems
Sort
View
MOC
1998
64views more  MOC 1998»
14 years 9 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...
TC
1998
14 years 9 months ago
Realizing Common Communication Patterns in Partitioned Optical Passive Stars (POPS) Networks
—We consider the problem of realizing several common communication structures in the all-optical Partitioned Optical Passive Stars (POPS) topology. We show that, often, the obvio...
Greg Gravenstreter, Rami G. Melhem
TCS
1998
14 years 9 months ago
Bubbles in Modularity
We provide a global technique, called neatening, for the study of modularity of left-linear Term Rewriting Systems. Objects called bubbles are identi ed as the responsibles of mos...
Massimo Marchiori
TCS
2002
14 years 9 months ago
Tilings as a programming exercise
We investigate the problem of producing symmetric tilings by programs in a uniform way. By this, we mean that the construction of a tiling should be parameterized by the geometric...
Guy Cousineau
MP
2007
95views more  MP 2007»
14 years 9 months ago
Smoothed analysis of integer programming
We present a probabilistic analysis of integer linear programs (ILPs). More specifically, we study ILPs in a so-called smoothed analysis in which it is assumed that first an adve...
Heiko Röglin, Berthold Vöcking