6105 search results - page 352 / 1221 » A Parallel Algorithm for Bound-Smoothing |
189
click to vote
ISPAN
2005
IEEE
16 years 10 days ago
2005
IEEE
In classical mechanism design setting the outcome of the mechanism is computed by a trusted central party. In this paper we consider distributed implementations in which the outco...
170
click to vote
IPPS
2003
IEEE
16 years 1 days ago
2003
IEEE
Graphic cards performance increase and fast Internet connections are popularising Networked Virtual Environments. This immature paradigm of real-time applications has still to sol...
187
click to vote
HPCA
1997
IEEE
15 years 11 months ago
1997
IEEE
ÐIn this paper, we study distributed path reservation protocols for multiplexed all-optical interconnection networks. The path reservation protocols negotiate the reservation and ...
194
click to vote
PPSN
1994
Springer
15 years 10 months ago
1994
Springer
We discuss the use of normal distribution theory as a tool to model the convergence characteristics of di erent GA selection schemes. The models predict the proportion of optimal a...
164
click to vote
EUROPAR
2000
Springer
15 years 10 months ago
2000
Springer
With the increasing processing power, the latency of the memory hierarchy becomes the stumbling block of many modern computer architectures. In order to speed-up the calculations, ...