1547 search results - page 29 / 310 » Solving Knapsack Problems in a Sticker Based Model |
160
click to vote
WSC
2004
15 years 7 months ago
2004
We present a conceptual framework for validating reusable behavioral models. The setting for this work is a modern product development environment in which design is performed by ...
194
click to vote
IWINAC
2007
Springer
16 years 17 days ago
2007
Springer
We consider the problem of designing error correcting codes (ECC), a hard combinatorial optimization problem of relevance in the field of telecommunications. This problem is firs...
183
Voted
IPPS
1998
IEEE
15 years 10 months ago
1998
IEEE
Abstract. Nowadays genetic algorithms stand as a trend to solve NPcomplete and NP-hard problems. In this paper, we present a new hybrid metaheuristic which uses Parallel Genetic Al...
165
click to vote
TSC
2010
15 years 1 months ago
2010
Today's data centers offer IT services mostly hosted on dedicated physical servers. Server virtualization provides a technical means for server consolidation. Thus, multiple v...
186
Voted
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...