591 search results - page 86 / 119 » A constraint programming approach to cutset problems |
CP
2005
Springer
15 years 3 months ago
2005
Springer
Besides search, complete inference methods can also be used to solve soft constraint problems. Their main drawback is the high spatial complexity. To improve its practical usage, w...
106
click to vote
GLOBECOM
2008
IEEE
15 years 4 months ago
2008
IEEE
—We consider the problem of joint routing, scheduling and power control in multi-hop wireless networks. We use a linear relation between link capacity and signal to interference ...
BMCBI
2010
14 years 10 months ago
2010
Background: High throughput sequencing (HTS) platforms produce gigabases of short read (<100 bp) data per run. While these short reads are adequate for resequencing application...
CPAIOR
2006
Springer
15 years 1 months ago
2006
Springer
Temporal planning (TP) is notoriously difficult because it requires to solve a propositional STRIPS planning problem with temporal constraints. In this paper, we propose an efficie...
SIAMJO
2010
14 years 8 months ago
2010
Abstract. We present a new “lifting” approach for the solution of nonlinear optimization problems (NLPs) that have objective and constraint functions with intermediate variable...