Sciweavers

10275 search results - page 1955 / 2055
» Case Studies of Autonomy
Sort
View
SPAA
1995
ACM
15 years 10 months ago
Parallel Sorting with Limited Bandwidth
We study the problem of sorting on a parallel computer with limited communication bandwidth. By using the PRAM(m) model, where p processors communicate through a globally shared me...
Micah Adler, John W. Byers, Richard M. Karp
COCO
1991
Springer
93views Algorithms» more  COCO 1991»
15 years 10 months ago
Relating Equivalence and Reducibility to Sparse Sets
For various polynomial-time reducibilities r, this paper asks whether being r-reducible to a sparse set is a broader notion than being r-equivalent to a sparse set. Although distin...
Eric Allender, Lane A. Hemachandra, Mitsunori Ogiw...
LICS
1991
IEEE
15 years 10 months ago
The Fixed Point Property in Synthetic Domain Theory
We present an elementary axiomatisation of synthetic domain theory and show that it is sufficient to deduce the fixed point property and solve domain equations. Models of these a...
Paul Taylor 0002
DAC
2010
ACM
15 years 9 months ago
Trace-driven optimization of networks-on-chip configurations
Networks-on-chip (NoCs) are becoming increasingly important in general-purpose and application-specific multi-core designs. Although uniform router configurations are appropriate ...
Andrew B. Kahng, Bill Lin, Kambiz Samadi, Rohit Su...
GECCO
2010
Springer
192views Optimization» more  GECCO 2010»
15 years 9 months ago
Resource abundance promotes the evolution of public goods cooperation
Understanding the evolution of cooperation as part of an evolutionary stable strategy (ESS) is a difficult problem that has been the focus of much work. The associated costs of co...
Brian D. Connelly, Benjamin E. Beckmann, Philip K....
« Prev « First page 1955 / 2055 Last » Next »