Sciweavers

Share
40 search results - page 1 / 8
» Parallel computation of the minimal elements of a poset
Sort
View
CAP
2010
8 years 6 months ago
Parallel computation of the minimal elements of a poset
Computing the minimal elements of a partially ordered finite set (poset) is a fundamental problem in combinatorics with numerous applications such as polynomial expression optimiz...
Charles E. Leiserson, Marc Moreno Maza, Liyun Li, ...
ACS
2007
8 years 11 months ago
More on Configurations in Priestley Spaces, and Some New Problems
Abstract. Prohibiting configurations (≡ induced finite connected posets) in Priestley spaces and properties of the associated classes of distributive lattices, and the related ...
Richard N. Ball, Ales Pultr, Jirí Sichler
PODC
2006
ACM
9 years 5 months ago
Quorum placement in networks: minimizing network congestion
A quorum system over a universe of logical elements is a collection of subsets (quorums) of elements, any two of which intersect. In numerous distributed algorithms, the elements ...
Daniel Golovin, Anupam Gupta, Bruce M. Maggs, Flor...
IPPS
2006
IEEE
9 years 5 months ago
Accelerating shape optimizing load balancing for parallel FEM simulations by algebraic multigrid
We propose a load balancing heuristic for parallel adaptive finite element method (FEM) simulations. In contrast to most existing approaches, the heuristic focuses on good partit...
Henning Meyerhenke, Burkhard Monien, Stefan Schamb...
ACS
2008
8 years 11 months ago
On Minimal Coalgebras
Abstract. We define an out-degree for F-coalgebras and show that the coalgebras of outdegree at most form a covariety. As a subcategory of all Fcoalgebras, this class has a termin...
H. Peter Gumm
books