Sciweavers

1243 search results - page 201 / 249
» On the locality of bounded growth
Sort
View
SPAA
2003
ACM
15 years 5 months ago
Compact routing with name independence
This paper is concerned with compact routing schemes for arbitrary undirected networks in the name-independent model first introduced by Awerbuch, Bar-Noy, Linial and Peleg. A co...
Marta Arias, Lenore Cowen, Kofi A. Laing, Rajmohan...
CP
2003
Springer
15 years 5 months ago
Generating High Quality Schedules for a Spacecraft Memory Downlink Problem
This work introduces a combinatorial optimization problem called Mars Express Memory Dumping Problem (Mex-Mdp), which arises in the European Space Agency program Mars Express. It c...
Angelo Oddi, Nicola Policella, Amedeo Cesta, Gabri...
DSN
2002
IEEE
15 years 4 months ago
Distributed Object Middleware to Support Dependable Information Sharing between Organisations
Organisations increasingly use the Internet to offer their own services and to utilise the services of others. This naturally leads to information sharing across organisational bo...
Nick Cook, Santosh K. Shrivastava, Stuart M. Wheat...
ECRTS
2002
IEEE
15 years 4 months ago
Scope-Tree: A Program Representation for Symbolic Worst-Case Execution Time Analysis
Most WCET analysis techniques only provide an upper bound on the worst case execution time as a constant value. However, it often appears that the execution time of a piece of cod...
Antoine Colin, Guillem Bernat
HPDC
2002
IEEE
15 years 4 months ago
Decoupling Computation and Data Scheduling in Distributed Data-Intensive Applications
In high energy physics, bioinformatics, and other disciplines, we encounter applications involving numerous, loosely coupled jobs that both access and generate large data sets. So...
Kavitha Ranganathan, Ian T. Foster