15485 search results - page 520 / 3097 » Computing Optimal Subsets |
179
click to vote
PDCAT
2004
Springer
16 years 11 days ago
2004
Springer
Recent works have classified de Bruijn graph (dBG) based broadcasting algorithms into local broadcasting and arc-disjoint spanning trees based broadcasting. However, those algorit...
171
click to vote
CP
2003
Springer
16 years 7 days ago
2003
Springer
Abstract. In many situations, a set of hard constraints encodes the feasible configurations of some system or product over which users have preferences. We consider the problem of...
191
click to vote
STACS
2010
Springer
16 years 4 days ago
2010
Springer
Let G = (V, E) be any undirected graph on V vertices and E edges. A path P between any two vertices u, v ∈ V is said to be t-approximate shortest path if its length is at most t ...
178
click to vote
IPPS
2002
IEEE
15 years 12 months ago
2002
IEEE
The problem of merging two intransitive sorted sequences (that is, to generate a sorted total order without the transitive property) is considered. A cost-optimal parallel merging...
192
click to vote
IPPS
2000
IEEE
15 years 11 months ago
2000
IEEE
Abstract. Nested data-parallel programs often have large memory requirements due to their high degree of parallelism. Piecewise execution is an implementation technique used to min...