2109 search results - page 161 / 422 » Solving Necklace Constraint Problems |
182
click to vote
CPAIOR
2009
Springer
16 years 25 days 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...
142
Voted
ASPDAC
2006
ACM
16 years 6 days ago
2006
ACM
System-on-chip and system-in-package result in increased number of I/O cells and complicated constraints for both chip designs and package designs. This renders the traditional ma...
148
click to vote
ECAI
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. Adaptive consistency is a solving algorithm for constraint networks. Its basic step is variable elimination: it takes a network as input, and producesan equivalent networ...
157
click to vote
AAAI
2008
15 years 8 months ago
2008
It is well-known that diversity among base classifiers is crucial for constructing a strong ensemble. Most existing ensemble methods obtain diverse individual learners through res...
166
click to vote
ATAL
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. The generalized assignment problem (GAP) is a typical NP-hard problem and has been studied for many years mainly in the operations research community. The goal of the GAP...