We have developed a distributed DSS capable to working in a dynamic way. That is, when a domain of an organization needs a new kind of information, the system looks for this infor...
We propose a novel replacement algorithm, called InterReference Gap Distribution Replacement (IGDR), for setassociative secondary caches of processors. IGDR attaches a weight to e...
Data intensive applications on clusters often require requests quickly be sent to the node managing the desired data. In many applications, one must look through a sorted tree str...
To carry out work assignments, small groups distributed within a larger enterprise often need to share documents among themselves while shielding those documents from others'...
Sergej Zerr, Elena Demidova, Daniel Olmedilla, Wol...
— One feature that classification algorithms typically lack is the ability to know what they do not know. With this knowledge an algorithm would be able to operate in any domain...