1142 search results - page 172 / 229 » Set Variables and Local Search |
172
click to vote
TEC
2010
15 years 26 days ago
2010
Nurse rostering is a difficult search problem with many constraints. In the literature, a number of approaches have been investigated including penalty function methods to tackle t...
141
click to vote
ICALP
2005
Springer
15 years 11 months ago
2005
Springer
We consider the problem of efficiently designing sets (codes) of equal-length DNA strings (words) that satisfy certain combinatorial constraints. This problem has numerous motivati...
167
click to vote
SEMWEB
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. Increasing the number of peers in a peer-to-peer network usually increases the number of answers to a given query as well. While having more answers is nice in principle,...
197
click to vote
MFCS
2009
Springer
15 years 10 months ago
2009
Springer
We present a simple algorithm for the maximum spanning star forest problem. We take advantage of the fact that the problem is a special case of complementary set cover and we adapt...
155
click to vote
AAAI
2010
15 years 7 months ago
2010
The AI community has achieved great success in designing high-performance algorithms for hard combinatorial problems, given both considerable domain knowledge and considerable eff...