Sciweavers

559 search results - page 46 / 112
» Fast SDP Algorithms for Constraint Satisfaction Problems
Sort
View
CORR
2010
Springer
248views Education» more  CORR 2010»
13 years 7 months ago
Optimal Spectrum Sharing in MIMO Cognitive Radio Networks via Semidefinite Programming
Abstract--In cognitive radio (CR) networks with multipleinput multiple-output (MIMO) links, secondary users (SUs) can exploit "spectrum holes" in the space domain to acce...
Ying Jun Zhang, Anthony Man-Cho So
EMO
2009
Springer
174views Optimization» more  EMO 2009»
14 years 2 months ago
Constraint Programming
To model combinatorial decision problems involving uncertainty and probability, we introduce stochastic constraint programming. Stochastic constraint programs contain both decision...
Pascal Van Hentenryck
TWC
2010
13 years 2 months ago
Fast algorithms for joint power control and scheduling in wireless networks
This paper studies the problem of finding a minimum-length schedule of a power-controlled wireless network subject to traffic demands and SINR (signal-to-interferenceplus-noise rat...
Liqun Fu, Soung Chang Liew, Jianwei Huang
BVAI
2007
Springer
14 years 1 months ago
Classification with Positive and Negative Equivalence Constraints: Theory, Computation and Human Experiments
We tested the efficiency of category learning when participants are provided only with pairs of objects, known to belong either to the same class (Positive Equivalence Constraints ...
Rubi Hammer, Tomer Hertz, Shaul Hochstein, Daphna ...
CSCLP
2007
Springer
14 years 1 months ago
Generalizing Global Constraints Based on Network Flows
Global constraints are used in constraint programming to help users specify patterns that occur frequently in the real world. In addition, global constraints facilitate the use of ...
Igor Razgon, Barry O'Sullivan, Gregory M. Provan