Sciweavers

1074 search results - page 155 / 215
» An ASM-Characterization of a Class of Distributed Algorithms
Sort
View
GC
2004
Springer
15 years 3 months ago
Verifying a Structured Peer-to-Peer Overlay Network: The Static Case
Abstract. Structured peer-to-peer overlay networks are a class of algorithms that provide efficient message routing for distributed applications using a sparsely connected communic...
Johannes Borgström, Uwe Nestmann, Luc Onana A...
VECPAR
2004
Springer
15 years 3 months ago
Domain Decomposition Methods for PDE Constrained Optimization Problems
Abstract. Optimization problems constrained by nonlinear partial differential equations have been the focus of intense research in scientific computing lately. Current methods for...
Ernesto E. Prudencio, Richard H. Byrd, Xiao-Chuan ...
IEEEPACT
2002
IEEE
15 years 2 months ago
Increasing and Detecting Memory Address Congruence
A static memory reference exhibits a unique property when its dynamic memory addresses are congruent with respect to some non-trivial modulus. Extraction of this congruence inform...
Samuel Larsen, Emmett Witchel, Saman P. Amarasingh...
CIAC
2010
Springer
252views Algorithms» more  CIAC 2010»
15 years 2 months ago
On the Number of Higher Order Delaunay Triangulations
Higher order Delaunay triangulations are a generalization of the Delaunay triangulation which provides a class of well-shaped triangulations, over which extra criteria can be optim...
Dieter Mitsche, Maria Saumell, Rodrigo I. Silveira
IPPS
2000
IEEE
15 years 2 months ago
Wavelengths Requirement for Permutation Routing in All-Optical Multistage Interconnection Networks
Previous studies showed that the cross-talk problem on the all-optical networks exists at both links and switches of the networks. To solve the cross-talk problem at both links and...
Qian-Ping Gu, Shietung Peng