Sciweavers

3433 search results - page 254 / 687
» Heuristics for a bidding problem
Sort
View
SAC
2009
ACM
16 years 1 months ago
Exploiting weak dependencies in tree-based search
In this work, our objective is to heuristically discover a simplified form of functional dependencies between variables called weak dependencies. Once discovered, these relations...
Alejandro Arbelaez, Youssef Hamadi
IPPS
2007
IEEE
16 years 1 months ago
Strategies for Replica Placement in Tree Networks
In this paper, we discuss and compare several policies to place replicas in tree networks, subject to server capacity constraints. The client requests are known beforehand, while ...
Anne Benoit, Veronika Rehn, Yves Robert
TAMC
2007
Springer
16 years 24 days ago
Approximately Optimal Trees for Group Key Management with Batch Updates
Abstract. We investigate the group key management problem for broadcasting applications. Previous work showed that, in handling key updates, batch rekeying can be more cost-effect...
Minming Li, Ze Feng, Ronald L. Graham, Frances F. ...
LCN
2005
IEEE
16 years 8 days ago
Light-Trail Networks: Design and Survivability
The light-trail architecture provides a novel solution to address IP-centric issues at the optical layer. By incorporating drop and continue functionality, overlaid with a lightwe...
Srivatsan Balasubramanian, Wensheng He, Arun K. So...
EUROPAR
2004
Springer
16 years 2 days ago
Scheduling Tasks Sharing Files from Distributed Repositories
Abstract. This paper is devoted to scheduling a large collection of independent tasks onto a distributed heterogeneous platform, which is composed of a set of servers. Each server ...
Arnaud Giersch, Yves Robert, Frédéri...