118 search results - page 22 / 24 » Greedy algorithms for on-line set-covering and related probl... |
EDBT
2009
ACM
15 years 4 months ago
2009
ACM
Materialized views (MV) can significantly improve the query performance of relational databases. In this paper, we consider MVs to optimize complex scenarios where many heterogen...
ICDCN
2010
Springer
15 years 4 months ago
2010
Springer
Abstract— Motivated by the widespread proliferation of wireless networks employing directional antennas, we study the problem of provisioning bandwidth in such networks. Given a ...
ML
2008
ACM
14 years 9 months ago
2008
ACM
Significant changes in the instance distribution or associated cost function of a learning problem require one to reoptimize a previously-learned classifier to work under new cond...
CIAC
2000
Springer
15 years 2 months ago
2000
Springer
A minimum spanning tree (MST) with a small diameter is required in numerous practical situations. It is needed, for example, in distributed mutual exclusion algorithms in order to ...
72
Voted
CORR
2010
Springer
14 years 6 months ago
2010
Springer
One of the main problems in all-optical packet-switched networks is the lack of optical buffers, and one feasible technology for the constructions of optical buffers is to use opt...