1547 search results - page 144 / 310 » Solving Knapsack Problems in a Sticker Based Model |
148
Voted
JCC
2006
15 years 3 months ago
2006
: This article describes a method for solving the geometric closure problem for simplified models of nucleic acid structures by using the constant bond lengths approximation. The r...
214
Voted
GECCO
2008
Springer
15 years 4 months ago
2008
Springer
One of the major difficulties when applying Multiobjective Evolutionary Algorithms (MOEA) to real world problems is the large number of objective function evaluations. Approximate...
141
Voted
ISCAPDCS
2003
15 years 5 months ago
2003
The development and use of cluster based computing is increasingly becoming an effective approach for solving high performance computing problems. The trend of moving away from sp...
135
Voted
ESORICS
2010
Springer
15 years 3 months ago
2010
Springer
Collaborative optimization problems can often be modeled as a linear program whose objective function and constraints combine data from several parties. However, important applicat...
123
Voted
CORR
2010
Springer
15 years 3 months ago
2010
Springer
The paper studies the visibility maintenance problem (VMP) for a leader-follower pair of robots modelled as first-order dynamic systems and proposes an original solution based on t...