Sciweavers

460 search results - page 66 / 92
» Bounding the locality of distributed routing algorithms
Sort
View
CORR
2008
Springer
103views Education» more  CORR 2008»
13 years 7 months ago
Path Loss Exponent Estimation in Large Wireless Networks
In wireless channels, the path loss exponent (PLE) has a strong impact on the quality of the links, and hence, it needs to be accurately estimated for the efficient design and oper...
Sunil Srinivasa, Martin Haenggi
SIGMOD
2010
ACM
324views Database» more  SIGMOD 2010»
14 years 17 days ago
Similarity search and locality sensitive hashing using ternary content addressable memories
Similarity search methods are widely used as kernels in various data mining and machine learning applications including those in computational biology, web search/clustering. Near...
Rajendra Shinde, Ashish Goel, Pankaj Gupta, Debojy...
AI
2002
Springer
13 years 7 months ago
The size distribution for Markov equivalence classes of acyclic digraph models
Bayesian networks, equivalently graphical Markov models determined by acyclic digraphs or ADGs (also called directed acyclic graphs or dags), have proved to be both effective and ...
Steven B. Gillispie, Michael D. Perlman
SODA
1998
ACM
104views Algorithms» more  SODA 1998»
13 years 9 months ago
On-line Randomized Call Control Revisited
We consider the problem of on-line call admission and routing on trees and meshes. Previous work gave randomized on-line algorithms for these problems and proved that they have opt...
Stefano Leonardi, Alberto Marchetti-Spaccamela, Al...
EOR
2006
125views more  EOR 2006»
13 years 7 months ago
A genetic algorithm for robotic assembly line balancing
Flexibility and automation in assembly lines can be achieved by the use of robots. The robotic assembly line balancing (RALB) problem is defined for robotic assembly line, where d...
Gregory Levitin, Jacob Rubinovitz, Boris Shnits