674 search results - page 45 / 135 » The computational complexity of the parallel knock-out probl... |
120
click to vote
SPAA
2004
ACM
15 years 6 months ago
2004
ACM
This paper presents the first polylogarithmic-competitive online algorithms for two-metric network design problems. These problems arise naturally in the design of computer netwo...
117
click to vote
PC
2000
15 years 1 months ago
2000
The LogP model is a model of parallel computation that characterises a parallel computer system by four parameters: the latency L, the overhead o, the gap g and the number of proc...
122
click to vote
PPSN
2010
Springer
14 years 11 months ago
2010
Springer
In the paper we propose a new evolutionary algorithm for induction of univariate regression trees that associate leaves with simple linear regression models. In contrast to typical...
125
click to vote
IPPS
2010
IEEE
14 years 11 months ago
2010
IEEE
We develop a widely applicable algorithm to solve the fault diagnosis problem in certain distributed-memory multiprocessor systems in which there are a limited number of faulty pr...
114
click to vote
ISPASS
2010
IEEE
15 years 8 months ago
2010
IEEE
—While many-core accelerator architectures, such as today’s Graphics Processing Units (GPUs), offer orders of magnitude more raw computing power than contemporary CPUs, their m...