Sciweavers

2944 search results - page 84 / 589
» Improving Bound Propagation
Sort
View
COCO
2003
Springer
162views Algorithms» more  COCO 2003»
14 years 3 months ago
Near-Optimal Lower Bounds on the Multi-Party Communication Complexity of Set Disjointness
We study the communication complexity of the set disjointness problem in the general multi-party model. For t players, each holding a subset of a universe of size n, we establish ...
Amit Chakrabarti, Subhash Khot, Xiaodong Sun
VTC
2006
IEEE
113views Communications» more  VTC 2006»
14 years 4 months ago
On the Practical Issues in Hop Count Localization of Sensors in a Multihop Network
– Simple algorithms have been developed in the area of node localization in a wireless sensor network. For these simple algorithms to work, several assumptions were made. However...
Eddie B. S. Tan, Joo Ghee Lim, Winston Khoon Guan ...
CORR
2007
Springer
121views Education» more  CORR 2007»
13 years 10 months ago
Diagrammatic Inference
Diagrammatic logics were introduced in 2002, with emphasis on the notions of specifications and models. In this paper we improve the description of the inference process, which i...
Dominique Duval
CPAIOR
2007
Springer
14 years 4 months ago
YIELDS: A Yet Improved Limited Discrepancy Search for CSPs
Abstract. In this paper, we introduce a Yet ImprovEd Limited Discrepancy Search (YIELDS), a complete algorithm for solving Constraint Satisfaction Problems. As indicated in its nam...
Wafa Karoui, Marie-José Huguet, Pierre Lope...
EWSN
2008
Springer
14 years 9 months ago
Efficient Clustering for Improving Network Performance in Wireless Sensor Networks
Clustering is an important mechanism in large multi-hop wireless sensor networks for obtaining scalability, reducing energy consumption and achieving better network performance. Mo...
Tal Anker, Danny Bickson, Danny Dolev, Bracha Hod