Sciweavers

710 search results - page 45 / 142
» On Minimum Power Connectivity Problems
Sort
View
CPAIOR
2010
Springer
13 years 5 months ago
Lazy Clause Generation: Combining the Power of SAT and CP (and MIP?) Solving
Finite domain propagation solving, the basis of constraint programming (CP) solvers, allows building very high-level models of problems, and using highly specific inference encapsu...
Peter J. Stuckey
ASPDAC
2006
ACM
90views Hardware» more  ASPDAC 2006»
14 years 1 months ago
A routability constrained scan chain ordering technique for test power reduction
Abstract— For scan-based testing, the high test power consumption may cause test power management problems, and the extra scan chain connections may cause routability degradation...
X.-L. Huang, J.-L. Huang
WG
2005
Springer
14 years 1 months ago
Extending the Tractability Border for Closest Leaf Powers
The NP-complete Closest 4-Leaf Power problem asks, given an undirected graph, whether it can be modified by at most edge insertions or deletions such that it becomes a 4-leaf powe...
Michael Dom, Jiong Guo, Falk Hüffner, Rolf Ni...
JSAC
2008
151views more  JSAC 2008»
13 years 7 months ago
Joint Beamforming and Power Allocation for Multiple Access Channels in Cognitive Radio Networks
A cognitive radio (CR) network is often described as a secondary network operating in a frequency band originally licensed/allocated to a primary network consisting of one or multi...
Lan Zhang, Ying-Chang Liang, Yan Xin
TWC
2008
225views more  TWC 2008»
13 years 7 months ago
Joint rate and power allocation for cognitive radios in dynamic spectrum access environment
Abstract--We investigate the dynamic spectrum sharing problem among primary and secondary users in a cognitive radio network. We consider the scenario where primary users exhibit o...
Dong In Kim, Long Le, Ekram Hossain