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...
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...
Emanuele Della Valle, Andrea Turati, Alessandro Gh...
Multiprocessor task scheduling is an important and computationally difficult problem. This paper proposes a comparison study of genetic algorithm and list scheduling algorithm. Bo...
—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...
Abstract. Emerging network monitoring infrastructures capture packetlevel traces or keep per-flow statistics at a set of distributed vantage points. Today, distributed monitors in...