16404 search results - page 487 / 3281 » A set coverage problem |
190
click to vote
DSS
2007
15 years 6 months ago
2007
This paper describes a service-based P2P overlay network architecture to support a collaborative environment for solving complex business processes over the network. In the propos...
145
click to vote
JCT
2007
15 years 6 months ago
2007
The codegree density γ(F) of an r-graph F is the largest number γ such that there are F-free r-graphs G on n vertices such that every set of r−1 vertices is contained in at le...
163
click to vote
ACTA
2000
15 years 6 months ago
2000
The paper refers to the Collatz's conjecture. In the first part, we present some equivalent forms of this conjecture and a slight generalization of a former result from [1]. T...
156
click to vote
TC
1998
15 years 6 months ago
1998
—When parallel programs are executed on multiprocessors with private caches, a set of data may be repeatedly used and modified by different threads. Such data sharing can often r...
152
click to vote
LOGCOM
2010
15 years 5 months ago
2010
The notion of warrant or justification is one of the central concepts in formal models of argumentation. The dialectical definition of warrant is expressed in terms of recursive...