303 search results - page 46 / 61 » Computing Minimal Spanning Subgraphs in Linear Time |
INFOCOM
2007
IEEE
14 years 1 months ago
2007
IEEE
Abstract—We present a distributed routing algorithm for finding two disjoint (primary and backup) QoS paths that run across multiple domains. Our work is inspired by the recent ...
TPDS
2010
13 years 2 months ago
2010
Predicting grid performance is a complex task because heterogeneous resource nodes are involved in a distributed environment. Long execution workload on a grid is even harder to pr...
RTSS
2005
IEEE
14 years 1 months ago
2005
IEEE
Scratchpad memory is a popular choice for on-chip storage in real-time embedded systems. The allocation of code/data to scratchpad memory is performed at compile time leading to p...
ISPD
2004
ACM
14 years 29 days ago
2004
ACM
VLSI placement tools usually work in two steps: First, the cells that have to be placed are roughly spread out over the chip area ignoring disjointness (global placement). Then, i...
CP
2004
Springer
14 years 28 days ago
2004
Springer
We combine mixed integer linear programming (MILP) and constraint programming (CP) to solve planning and scheduling problems. Tasks are allocated to facilities using MILP and sche...