Sciweavers

20441 search results - page 35 / 4089
» Locally Computable Structures
Sort
View
DIALM
2003
ACM
175views Algorithms» more  DIALM 2003»
14 years 27 days ago
Localized construction of bounded degree and planar spanner for wireless ad hoc networks
We propose a novel localized algorithm that constructs a bounded degree and planar spanner for wireless ad hoc networks modeled by unit disk graph (UDG). Every node only has to kn...
Yu Wang 0003, Xiang-Yang Li
IPPS
2007
IEEE
14 years 1 months ago
Locality-Aware Consistency Maintenance for Heterogeneous P2P Systems
Replication and caching have been deployed widely in current P2P systems. In update-allowed P2P systems, a consistency maintenance mechanism is strongly demanded. Several solution...
Zhenyu Li, Gaogang Xie, Zhongcheng Li
HEURISTICS
2002
122views more  HEURISTICS 2002»
13 years 7 months ago
Complete Local Search with Memory
Neighborhood search heuristics like local search and its variants are some of the most popular approaches to solve discrete optimization problems of moderate to large size. Apart ...
Diptesh Ghosh, Gerard Sierksma
BMCBI
2008
87views more  BMCBI 2008»
13 years 7 months ago
Protein structure search and local structure characterization
Background: Structural similarities among proteins can provide valuable insight into their functional mechanisms and relationships. As the number of available three-dimensional (3...
Shih-Yen Ku, Yuh-Jyh Hu
HPCA
2008
IEEE
14 years 8 months ago
Address-branch correlation: A novel locality for long-latency hard-to-predict branches
Hard-to-predict branches depending on longlatency cache-misses have been recognized as a major performance obstacle for modern microprocessors. With the widening speed gap between...
Hongliang Gao, Yi Ma, Martin Dimitrov, Huiyang Zho...