163 search results - page 30 / 33 » Optimal Resource Assignment in Internet Data Centers |
179
Voted
VLDB
2004
ACM
15 years 11 months ago
2004
ACM
It is well established that bitmap indices are efficient for read-only attributes with low attribute cardinalities. For an attribute with a high cardinality, the size of the bitma...
209
click to vote
DAIS
2006
15 years 7 months ago
2006
This paper shows how to build a scalable, robust and efficient distributed Internet-scale RDF repository, that we name PAGE (Put And Get Everywhere). 1 Motivation In the recent yea...
185
click to vote
CORR
2010
Springer
15 years 5 months ago
2010
Springer
Multiprocessor task scheduling is an important and computationally difficult problem. This paper proposes a comparison study of genetic algorithm and list scheduling algorithm. Bo...
185
Voted
INFOCOM
2009
IEEE
16 years 14 days ago
2009
IEEE
—A major problem in wireless networks is coping with limited resources, such as bandwidth and energy. These issues become a major algorithmic challenge in view of the dynamic nat...
141
Voted
PAM
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. Emerging network monitoring infrastructures capture packetlevel traces or keep per-flow statistics at a set of distributed vantage points. Today, distributed monitors in...