Sciweavers

4103 search results - page 144 / 821
» Some results on the Collatz problem
Sort
View
DAM
2011
15 years 1 months ago
Matchability and k-maximal matchings
We present a collection of new structural, algorithmic, and complexity results for two types of matching problems. The first problem involves the computation of k-maximal matchin...
Brian C. Dean, Sandra Mitchell Hedetniemi, Stephen...
TIT
2011
209views more  TIT 2011»
15 years 1 months ago
Belief Propagation and LP Relaxation for Weighted Matching in General Graphs
Loopy belief propagation has been employed in a wide variety of applications with great empirical success, but it comes with few theoretical guarantees. In this paper we analyze t...
Sujay Sanghavi, Dmitry M. Malioutov, Alan S. Wills...
AAAI
2011
14 years 6 months ago
Qualitative Numeric Planning
We consider a new class of planning problems involving a set of non-negative real variables, and a set of non-deterministic actions that increase or decrease the values of these v...
Siddharth Srivastava, Shlomo Zilberstein, Neil Imm...
TON
2010
197views more  TON 2010»
15 years 5 months ago
Constrained relay node placement in wireless sensor networks: formulation and approximations
—One approach to prolong the lifetime of a wireless sensor network (WSN) is to deploy some relay nodes to communicate with the sensor nodes, other relay nodes, and the base stati...
Satyajayant Misra, Seung Don Hong, Guoliang Xue, J...
DKE
2007
156views more  DKE 2007»
15 years 6 months ago
Efficient index and data allocation for wireless broadcast services
The periodic broadcasting of frequently requested data can reduce the workload of uplink channels and improve data access for users in a wireless network. Since mobile devices hav...
Shou-Chih Lo, Arbee L. P. Chen