7133 search results - page 1136 / 1427 » Communication algorithms with advice |
207
click to vote
ASAP
2002
IEEE
16 years 12 days ago
2002
IEEE
With the growth of the Internet and mobile communication industry, multimedia applications form a dominant computer workload. Media workloads are typically executed on Application...
225
click to vote
CCO
2001
Springer
15 years 12 months ago
2001
Springer
Branch, cut, and price (BCP) is an LP-based branch and bound technique for solving large-scale discrete optimization problems (DOPs). In BCP, both cuts and variables can be generat...
231
click to vote
ICDT
2001
ACM
15 years 12 months ago
2001
ACM
This paper presents a general methodology for the efficient parallelization of existing data cube construction algorithms. We describe two different partitioning strategies, one f...
208
click to vote
HPDC
2000
IEEE
15 years 12 months ago
2000
IEEE
To provide Quality of Service (QoS) guarantee in distributed services, it is necessary to reserve multiple computing and communication resources for each service session. Meanwhile...
240
click to vote
PCRCW
1997
Springer
15 years 11 months ago
1997
Springer
In recent years, theChaos Project at theUniversityofWashingtonhas analyzed and simulated a dozen routing algorithms. Three new routing algorithms have been invented; of these, the...