2109 search results - page 188 / 422 » Solving Necklace Constraint Problems |
180
click to vote
HEURISTICS
2010
15 years 3 months ago
2010
This paper investigates an adaptive constructive method for solving nurse rostering problems. The constraints considered in the problems are categorised into three classes: those t...
176
click to vote
LCN
2006
IEEE
16 years 14 days ago
2006
IEEE
There is increasing research interest in solving routing problems in sensor networks subject to constraints such as data correlation, link reliability and energy conservation. Sin...
165
click to vote
CP
2005
Springer
16 years 10 hour ago
2005
Springer
This paper describes an efficient, complete approach for solving a complex allocation and scheduling problem for Multi-Processor System-on-Chip (MPSoC). Given a throughput constra...
222
click to vote
EMNLP
2006
15 years 7 months ago
2006
Integer Linear Programming has recently been used for decoding in a number of probabilistic models in order to enforce global constraints. However, in certain applications, such a...
172
click to vote
FOCS
2007
IEEE
16 years 24 days ago
2007
IEEE
: It is well-known that constraint satisfaction problems (CSP) over an unbounded domain can be solved in time nO(k) if the treewidth of the primal graph of the instance is at most ...