1480 search results - page 159 / 296 » Ants can solve constraint satisfaction problems |
197
click to vote
CONSTRAINTS
2008
15 years 6 months ago
2008
Aligning DNA and protein sequences is a core technique in molecular biology. Often, it is desirable to include partial prior knowledge and conditions in an alignment. Going beyond...
188
click to vote
CPAIOR
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. The multileaf collimator sequencing problem is an important component in effective cancer treatment delivery. The problem can be formulated as finding a decomposition of...
186
click to vote
COCOA
2007
Springer
16 years 21 days ago
2007
Springer
Abstract. Many combinatorial optimization problems can be formulated as 0/1 integer programs (0/1 IPs). The investigation of the structure of these problems raises the following ta...
133
click to vote
EOR
2010
15 years 6 months ago
2010
The Tree-of-Hubs Location Problem is studied. This problem, which combines several aspects of some location, network design and routing problems, is inspired by those transportati...
178
click to vote
ICLP
2005
Springer
16 years 1 days ago
2005
Springer
Abstract. Constraints and preferences are ubiquitous in real-life. Moreover, preferences can be of many kinds: qualitative, quantitative, conditional, positive or negative, to name...