Sciweavers

6800 search results - page 1248 / 1360
» On optimizing collective communication
Sort
View
JGAA
2000
179views more  JGAA 2000»
14 years 9 months ago
Approximation Algorithms for Some Graph Partitioning Problems
This paper considers problems of the following type: given an edgeweighted k-colored input graph with maximum color class size c, find a minimum or maximum c-way cut such that eac...
George He, Jiping Liu, Cheng Zhao
ALGORITHMICA
1998
184views more  ALGORITHMICA 1998»
14 years 9 months ago
Approximation Algorithms for Connected Dominating Sets
The dominatingset problemin graphs asks for a minimumsize subset of vertices with the followingproperty: each vertex is required to either be in the dominating set, or adjacent to...
Sudipto Guha, Samir Khuller
IWC
2002
98views more  IWC 2002»
14 years 9 months ago
Living memory: agent-based information management for connected local communities
We investigate the application of multi-agent systems to develop intelligent information interfaces for connected communities, a class of computer applications aimed at enhancing ...
Kostas Stathis, Oscar de Bruijn, Silvio Macedo
MST
2002
169views more  MST 2002»
14 years 9 months ago
Bulk Synchronous Parallel Algorithms for the External Memory Model
Abstract. Blockwise access to data is a central theme in the design of efficient external memory (EM) algorithms. A second important issue, when more than one disk is present, is f...
Frank K. H. A. Dehne, Wolfgang Dittrich, David A. ...
SCP
1998
107views more  SCP 1998»
14 years 9 months ago
A Distributed Arc-Consistency Algorithm
Consistency techniques are an e cient way of tackling constraint satisfaction problems (CSP). In particular, various arc-consistency algorithms have been designed such as the time...
T. Nguyen, Yves Deville
« Prev « First page 1248 / 1360 Last » Next »