9842 search results - page 1504 / 1969 » The Complexity of the Matching-Cut Problem |
206
click to vote
ICDCS
1999
IEEE
15 years 11 months ago
1999
IEEE
Recently, push-based delivery has attracted considerable attention as a means of disseminating information to large client populations in both wired and wireless settings. In this...
227
click to vote
AIMDM
1999
Springer
15 years 11 months ago
1999
Springer
Knowledge representation has always been a major problem in the design of medical decision support systems. In this paper we present a new methodology to represent and reason about...
169
click to vote
IPPS
1999
IEEE
15 years 11 months ago
1999
IEEE
We present a coarse grained parallel algorithm for computing a maximum matching in a convex bipartite graph G = A;B;E. For p processors with N=p memory per processor, N = jAj+jBj,...
186
click to vote
DBPL
1999
Springer
15 years 11 months ago
1999
Springer
Construction of complex software systems with largely off-the-shelf components has become a reality with the wide availability and acceptance of component frameworks and distribut...
201
click to vote
ECAL
1999
Springer
15 years 11 months ago
1999
Springer
We use a new general-purpose model of neutral evolution of genotypes to make quantitative comparisons of diversity and adaptive evolutionary activity as a function of mutation rate...