840 search results - page 63 / 168 » Open multi-methods for c |
119
click to vote
CASCON
1997
15 years 4 months ago
1997
The role of brokers in client-server systems is to accommodate flexible, open, heterogeneous system design and to facilitate fault tolerance and improved performance through load...
115
click to vote
SODA
1997
ACM
15 years 4 months ago
1997
ACM
The permutation routing problem is studied for trees under the matching model. By introducing a novel and useful (so-called) caterpillar tree partition, we prove that any permutati...
134
click to vote
ARSCOM
2008
15 years 3 months ago
2008
We present 3 open challenges in the field of Costas arrays. They are: a) the determination of the number of dots on the main diagonal of a Welch array, and especially the maximal ...
109
Voted
WWW
2003
ACM
16 years 3 months ago
2003
ACM
In this paper we propose a multicast-on-large-demand (MOLD) approach to the flash crowd problem. A MOLD Web server may dynamically open a multicast channel for resources when dete...
238
Voted
POPL
2004
ACM
16 years 3 months ago
2004
ACM
We define seal, an untyped call-by-value -calculus with primitives for protecting abstract data by sealing, and develop a bisimulation proof method that is sound and complete with...