Sciweavers

578 search results - page 36 / 116
» The Minimum-Entropy Set Cover Problem
Sort
View
MST
2010
187views more  MST 2010»
13 years 3 months ago
Distributed Approximation of Capacitated Dominating Sets
We study local, distributed algorithms for the capacitated minimum dominating set (CapMDS) problem, which arises in various distributed network applications. Given a network graph...
Fabian Kuhn, Thomas Moscibroda
CSCLP
2003
Springer
14 years 2 months ago
Clustering for Disconnected Solution Sets of Numerical CSPs
This paper considers the issue of postprocessing the output of interval-based solvers for further exploitations when solving numerical CSPs with continuum of solutions. Most interv...
Xuan-Ha Vu, Djamila Sam-Haroud, Boi Faltings
CORR
2007
Springer
99views Education» more  CORR 2007»
13 years 8 months ago
Periodic complementary sets of binary sequences
Let PCSN p denote a set of p binary sequences of length N such that the sum of their periodic auto-correlation functions is a δ-function. In the 1990, B¨omer and Antweiler addres...
Dragomir Z. Djokovic
GLVLSI
2007
IEEE
139views VLSI» more  GLVLSI 2007»
14 years 3 months ago
Synthesis of irregular combinational functions with large don't care sets
A special logic synthesis problem is considered for Boolean functions which have large don’t care sets and are irregular. Here, a function is considered as irregular if the inpu...
Valentin Gherman, Hans-Joachim Wunderlich, R. D. M...
INFOCOM
2007
IEEE
14 years 3 months ago
Target-Oriented Scheduling in Directional Sensor Networks
— Unlike convectional omni-directional sensors that always have an omni-angle of sensing range, directional sensors may have a limited angle of sensing range due to technical con...
Yanli Cai, Wei Lou, Minglu Li, X.-Y. Li