Sciweavers

6907 search results - page 1294 / 1382
» Securing distributed adaptation
Sort
View
ICPP
1998
IEEE
15 years 2 months ago
Routing Algorithms for Anycast Messages
Use of anycast service can considerably simplify many communication applications. Two approaches can be used for routing anycast packets. Single-path routing always uses the same ...
Dong Xuan, Weijia Jia, Wei Zhao
IPPS
1998
IEEE
15 years 2 months ago
A Clustered Approach to Multithreaded Processors
With aggressive superscalar processors delivering diminishing returns, alternate designs that make good use of the increasing chip densities are actively being explored. One such ...
Venkata Krishnan, Josep Torrellas
SPAA
1993
ACM
15 years 2 months ago
Asymptotically Tight Bounds for Performing BMMC Permutations on Parallel Disk Systems
d Abstract) Thomas H. Cormen Leonard F. Wisniewski Department of Mathematics and Computer Science Dartmouth College We give asymptotically equal lower and upper bounds for the num...
Thomas H. Cormen, Leonard F. Wisniewski
ECOOPW
2007
Springer
15 years 1 months ago
Enabling Software Evolution Via AOP and Reflection
Following last three years' RAM-SE (Reflection, AOP and Meta-Data for Software Evolution) workshop at the ECOOP conference, the RAM-SE'07 workshop was a successful and po...
Manuel Oriol, Walter Cazzola, Shigeru Chiba, Gunte...
ATAL
2006
Springer
15 years 1 months ago
Accident or intention: that is the question (in the Noisy Iterated Prisoner's Dilemma)
This paper focuses on the Noisy Iterated Prisoner's Dilemma, a version of the Iterated Prisoner's Dilemma (IPD) in which there is a nonzero probability that a "coop...
Tsz-Chiu Au, Dana S. Nau
« Prev « First page 1294 / 1382 Last » Next »