Sciweavers

4218 search results - page 162 / 844
» Complete sets of cooperations
Sort
View
112
Voted
ATAL
2008
Springer
15 years 2 months ago
Shared focus of attention for heterogeneous agents
A network of cooperating agents must be able to reach rough consensus on a set of topics for cooperation. With highly heterogeneous agents, however, incommensurable measures and i...
Jacob Beal
91
Voted
FUIN
2006
88views more  FUIN 2006»
15 years 23 days ago
Calculi of Approximation Spaces
This paper considers the problem of how to establish calculi of approximation spaces. Approximation spaces considered in the context of rough sets were introduced by Zdzislaw Pawla...
Andrzej Skowron, Jaroslaw Stepaniuk, James F. Pete...
88
Voted
JCSS
1998
74views more  JCSS 1998»
15 years 13 days ago
Reductions in Circuit Complexity: An Isomorphism Theorem and a Gap Theorem
We show that all sets that are complete for NP under non-uniform AC0 reductions are isomorphic under non-uniform AC0-computable isomorphisms. Furthermore, these sets remain NP-com...
Manindra Agrawal, Eric Allender, Steven Rudich
109
Voted
GECCO
2007
Springer
196views Optimization» more  GECCO 2007»
15 years 7 months ago
Optimal nesting of species for exact cover of resources: two against many
The application of resource-defined fitness sharing (RFS) to shape nesting problems reveals a remarkable ability to discover tilings [7, 8]. These tilings represent exact covers...
Jeffrey Horn
CORR
2006
Springer
129views Education» more  CORR 2006»
15 years 24 days ago
On the Optimality of the ARQ-DDF Protocol
The performance of the automatic repeat request-dynamic decode and forward (ARQ-DDF) cooperation protocol is analyzed in two distinct scenarios. The first scenario is the multiple...
Kambiz Azarian, Hesham El Gamal, Philip Schniter