2109 search results - page 205 / 422 » Solving Necklace Constraint Problems |
189
click to vote
CP
2006
Springer
15 years 10 months ago
2006
Springer
In previous work, a new approach called Open CSP (OCSP) was defined as a way of integrate information gathering and problem solving. Instead of collecting all variable values befor...
198
click to vote
ICC
2008
IEEE
16 years 1 months ago
2008
IEEE
—This paper concerns the problem of finding the minimum-length TDMA frame of a power-controlled wireless network subject to traffic demands and SINR (signalto-interference-plus...
155
click to vote
PADL
2010
Springer
16 years 3 months ago
2010
Springer
Abstract. Mathematical programs (MPs) are a class of constrained optimization problems that include linear, mixed-integer, and disjunctive programs. Strategies for solving MPs rely...
212
click to vote
TWC
2008
15 years 7 months ago
2008
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...
229
Voted
JSAT
2006
15 years 7 months ago
2006
This paper introduces a new hybrid method for efficiently integrating Pseudo-Boolean (PB) constraints into generic SAT solvers in order to solve PB satisfiability and optimization...