Sciweavers

10819 search results - page 21 / 2164
» Addition and multiplication of sets
Sort
View
LATIN
2010
Springer
14 years 2 months ago
Layered Working-Set Trees
The working-set bound [Sleator and Tarjan, J. ACM, 1985] roughly states that searching for an element is fast if the element was accessed recently. Binary search trees, such as sp...
Prosenjit Bose, Karim Douïeb, Vida Dujmovic, ...
AIPS
2008
13 years 10 months ago
Additive-Disjunctive Heuristics for Optimal Planning
The development of informative, admissible heuristics for cost-optimal planning remains a significant challenge in domain-independent planning research. Two techniques are commonl...
Andrew Coles, Maria Fox, Derek Long, Amanda Smith
GLOBECOM
2008
IEEE
14 years 2 months ago
A Memory-Optimized Bloom Filter Using an Additional Hashing Function
— A Bloom filter is a simple space-efficient randomized data structure for the representation set of items in order to support membership queries. In recent years, Bloom filte...
Mahmood Ahmadi, Stephan Wong
LICS
2009
IEEE
14 years 2 months ago
The General Vector Addition System Reachability Problem by Presburger Inductive Invariants
The reachability problem for Vector Addition Systems (VASs) is a central problem of net theory. The general problem is known decidable by algorithms exclusively based on the class...
Jérôme Leroux
ICUMT
2009
13 years 5 months ago
Hierarchical p2p overlays for DVE: An Additively Weighted Voronoi based approach
This paper presents a support for the development of Distributed Virtual Environments (DVEs) on P2P architectures. A hierarchical overlay is defined by pairing each peer with a wei...
Michele Albano, Laura Ricci, Luca Genovali