4218 search results - page 181 / 844 » Complete sets of cooperations |
146
click to vote
JGT
2008
15 years 6 months ago
2008
Let C be a family of n compact connected sets in the plane, whose intersection graph G(C) has no complete bipartite subgraph with k vertices in each of its classes. Then G(C) has ...
159
click to vote
RSA
2002
15 years 5 months ago
2002
: Suppose that independent U 0 1 weights are assigned to the d 2 n2 edges of the complete d-partite graph with n vertices in each of the d = maximal independent sets. Then the expe...
154
click to vote
GECCO
2007
Springer
16 years 12 days ago
2007
Springer
Imagine a group of cooperating agents attempting to allocate tasks amongst themselves without knowledge of their own capabilities. Over time, they develop a belief of their own sk...
125
click to vote
DSN
2005
IEEE
15 years 12 months ago
2005
IEEE
Supercomputing systems must be able to reliably and efficiently complete their assigned workloads, even in the presence of failures. This paper proposes a system that allows the ...
139
click to vote
IAT
2005
IEEE
15 years 12 months ago
2005
IEEE
Our previous research presents a methodology of cooperative problem solving for BDI systems, based on a complete formal theory. This covers both a static part, defining individua...