Sciweavers

2157 search results - page 318 / 432
» Binary ant algorithm
Sort
View
169
Voted
SWAT
1992
Springer
147views Algorithms» more  SWAT 1992»
15 years 9 months ago
Efficient Rebalancing of Chromatic Search Trees
In PODS'91, Nurmi and Soisalon-Soininen presented a new type of binary search tree for databases, which they call a chromatic tree. The aim is to improve runtime performance ...
Joan Boyar, Kim S. Larsen
132
Voted
WDAG
1990
Springer
80views Algorithms» more  WDAG 1990»
15 years 9 months ago
Tight Bounds on the Round Complexity of Distributed 1-Solvable Tasks
A distributed task T is 1-solvable if there exists a protocol that solves it in the presence of (at most) one crash failure. A precise characterization of the 1-solvable tasks was...
Ofer Biran, Shlomo Moran, Shmuel Zaks
GLOBECOM
2007
IEEE
15 years 5 months ago
Multi-Class QoS in 802.11 Networks Using Gentle Decrease of Multiple Contention Windows
—IEEE 802.11 Distributed Coordination Function (DCF) uses a binary exponential backoff algorithm to arbitrate simultaneous channel access by multiple stations. When a station sen...
Bushra Anjum, Zartash Afzal Uzmi
ECCC
2011
188views ECommerce» more  ECCC 2011»
14 years 12 months ago
Three Query Locally Decodable Codes with Higher Correctness Require Exponential Length
Locally decodable codes are error correcting codes with the extra property that, in order to retrieve the correct value of just one position of the input with high probability, it...
Anna Gál, Andrew Mills
ICCV
2011
IEEE
14 years 5 months ago
The Power of Comparative Reasoning
Rank correlation measures are known for their resilience to perturbations in numeric values and are widely used in many evaluation metrics. Such ordinal measures have rarely been ...
Jay Yagnik, Dennis Strelow, David Ross, Ruei-sung ...