Sciweavers

3584 search results - page 199 / 717
» Parallel Computing of Thermoelasticity Problems
Sort
View
MFCS
2004
Springer
15 years 3 months ago
Crossing Number Is Hard for Cubic Graphs
It was proved by [Garey and Johnson, 1983] that computing the crossing number of a graph is an NP-hard problem. Their reduction, however, used parallel edges and vertices of very h...
Petr Hlinený
IPPS
2000
IEEE
15 years 2 months ago
A Distributed Real Time Coordination Protocol
: When the communication channels are subject to interruptions such as jamming, the coordination of the real time motions of distributed autonomous vehicles becomes a challenging p...
Lui Sha, Danbing Seto
ECOOPW
1999
Springer
15 years 2 months ago
Flexible Aliasing with Protection
Unwanted effects of aliasing cause encapsulation problems in object oriented programming. Nevertheless, aliasing is part of common and efficient programming techniques for expres...
Günter Kniesel, Dirk Theisen
IPPS
2010
IEEE
14 years 8 months ago
Attack-resistant frequency counting
We present collaborative peer-to-peer algorithms for the problem of approximating frequency counts for popular items distributed across the peers of a large-scale network. Our alg...
Bo Wu, Jared Saia, Valerie King
CCGRID
2008
IEEE
15 years 4 months ago
Joint Communication and Computation Task Scheduling in Grids
In this paper we present a multicost algorithm for the joint time scheduling of the communication and computation resources that will be used by a task. The proposed algorithm sel...
Kostas Christodoulopoulos, Nikolaos D. Doulamis, E...