— The problem of efficient data structures for IP lookups has been well studied in literature. Techniques such as LC tries and Extensible Hashing are commonly used. In this pape...
Ioannis Ioannidis, Ananth Grama, Mikhail J. Atalla...
Distributed Hash Tables (DHTs) bring the promise of increased availability of data to wide-area systems, under the assumption of uniform request load. However, they don't int...
Agents based on reactive planning architectures use pre-specified plans as behaviour specifications. Normative agents are motivated by norms in their behaviour: obligations motiva...
Abstract.1 The scheme of the sliding window is known in Information Theory, Computer Science, the problem of predicting and in stastistics. Let a source with unknown statistics gen...
In this work we try to bridge the gap often encountered by researchers who find themselves with few or no labeled examples from their desired target domain, yet still have access ...