3532 search results - page 645 / 707 » Overlay networks with class |
APPROX
2000
Springer
15 years 4 months ago
2000
Springer
Motivated by the problem of WDM routing in all–optical networks, we study the following NP–hard problem. We are given a directed binary tree T and a set R of directed paths on ...
CP
2000
Springer
15 years 4 months ago
2000
Springer
plexity Theorems: Talk Abstract . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 13 David McAllester Regular Papers Automatic Generation of Propagation Rules for F...
PPOPP
1999
ACM
15 years 4 months ago
1999
ACM
Writing parallel applications for computational grids is a challenging task. To achieve good performance, algorithms designed for local area networks must be adapted to the differ...
FTDCS
1999
IEEE
15 years 4 months ago
1999
IEEE
The impact of buffer management and priority scheduling is examined in stressful scenarios when the aggregate incoming traffic is higher than the output link capacity of an Asynch...
COMPULOG
1999
Springer
15 years 4 months ago
1999
Springer
Many constraint satisfaction problems can be naturally and efficiently modelled using non-binary constraints like the “all-different” and “global cardinality” constraints...