Sciweavers

281 search results - page 8 / 57
» Balancing weight-balanced trees
Sort
View
152
Voted
AAMAS
2012
Springer
13 years 11 months ago
Winner determination in voting trees with incomplete preferences and weighted votes
In multiagent settings where agents have different preferences, preference aggregation can be an important issue. Voting is a general method to aggregate preferences. We consider ...
Jérôme Lang, Maria Silvia Pini, Franc...
124
Voted
IJISEC
2002
86views more  IJISEC 2002»
15 years 3 months ago
Using AVL trees for fault-tolerant group key management
In this paper we describe an efficient algorithm for the management of group-keys for Group Communication Systems. Our algorithm is based on the notion of key-graphs, previously u...
Ohad Rodeh, Kenneth P. Birman, Danny Dolev
WADS
1993
Springer
136views Algorithms» more  WADS 1993»
15 years 7 months ago
Balanced Search Trees Made Simple
Abstract. As a contribution to the recent debate on simple implementations of dictionaries, we present new maintenancealgorithms for balanced trees. In terms of code simplicity, ou...
Arne Andersson
165
Voted
ICNP
2006
IEEE
15 years 9 months ago
DPTree: A Balanced Tree Based Indexing Framework for Peer-to-Peer Systems
— Peer-to-peer (P2P) systems have been widely used for exchange of voluminous information and resources among thousands or even millions of users. Since shared data are normally ...
Mei Li, Wang-Chien Lee, Anand Sivasubramaniam
232
Voted
VLDB
2005
ACM
397views Database» more  VLDB 2005»
16 years 3 months ago
Concurrency control and recovery for balanced B-link trees
Abstract. In this paper we present new concurrent and recoverable B-link-tree algorithms. Unlike previous algorithms, ours maintain the balance of the B-link tree at all times, so ...
Ibrahim Jaluta, Seppo Sippu, Eljas Soisalon-Soinin...