Sciweavers

2303 search results - page 145 / 461
» Interior-Point Methods in Parallel Computation
Sort
View
MOC
2002
144views more  MOC 2002»
15 years 3 months ago
Convergence rate analysis of an asynchronous space decomposition method for convex Minimization
Abstract. We analyze the convergence rate of an asynchronous space decomposition method for constrained convex minimization in a reflexive Banach space. This method includes as spe...
Xue-Cheng Tai, Paul Tseng
186
Voted
SPAA
1993
ACM
15 years 7 months ago
Asymptotically Tight Bounds for Performing BMMC Permutations on Parallel Disk Systems
d Abstract) Thomas H. Cormen Leonard F. Wisniewski Department of Mathematics and Computer Science Dartmouth College We give asymptotically equal lower and upper bounds for the num...
Thomas H. Cormen, Leonard F. Wisniewski
127
Voted
SIGMETRICS
2002
ACM
105views Hardware» more  SIGMETRICS 2002»
15 years 3 months ago
Modeling and analysis of dynamic coscheduling in parallel and distributed environments
Scheduling in large-scale parallel systems has been and continues to be an important and challenging research problem. Several key factors, including the increasing use of off-the...
Mark S. Squillante, Yanyong Zhang, Anand Sivasubra...
141
Voted
MMAS
2010
Springer
14 years 10 months ago
A Novel Method for Solving Multiscale Elliptic Problems with Randomly Perturbed Data
We propose a method for efficient solution of elliptic problems with multiscale features and randomly perturbed coefficients. We use the multiscale finite element method (MsFEM) as...
Victor Ginting, Axel Målqvist, Michael Presh...
117
Voted
EDOC
2008
IEEE
15 years 10 months ago
EA4UP: An Enterprise Architecture-Assisted Telecom Service Development Method
The cost of a telecom service development is correlated to the discontinuity and the complexity of the process. To solve this problem, we propose a method dedicated to telecom ser...
Jacques Simonin, Francis Alizon, Jean-Pierre Desch...