Sciweavers

256 search results - page 26 / 52
» Comparison of Heuristic and Optimal Subcarrier Assignment Al...
Sort
View
GECCO
2000
Springer
112views Optimization» more  GECCO 2000»
14 years 8 days ago
Code Compaction Using Genetic Algorithms
One method for compacting executable computer code is to replace commonly repeated sequences of instructions with macro instructions from a decoding dictionary. The size of the de...
Keith E. Mathias, Larry J. Eshelman, J. David Scha...
ICGA
1997
122views Optimization» more  ICGA 1997»
13 years 10 months ago
A Comparison of Global and Local Search Methods in Drug Docking
Molecular docking software makes computational predictions of the interaction of molecules. This can be useful, for example, in evaluating the binding of candidate drug molecules ...
Christopher D. Rosin, R. Scott Halliday, William E...
CONSTRAINTS
2011
13 years 7 days ago
CP and IP approaches to cancer radiotherapy delivery optimization
Abstract. We consider the problem of decomposing an integer matrix into a positively weighted sum of binary matrices that have the consecutive-ones property. This problem is well-k...
Davaatseren Baatar, Natashia Boland, Sebastian Bra...
ISNN
2010
Springer
14 years 1 months ago
Multiattribute Bayesian Preference Elicitation with Pairwise Comparison Queries
Preference elicitation (PE) is an important component of interactive decision support systems that aim to make optimal recommendations to users by actively querying their preferen...
Shengbo Guo, Scott Sanner
INFOCOM
2002
IEEE
14 years 1 months ago
Optimal Configuration of OSPF Aggregates
—Open Shortest Path First (OSPF) is a popular protocol for routing within an autonomous system (AS) domain. In order to scale for large networks containing hundreds and thousands...
Rajeev Rastogi, Yuri Breitbart, Minos N. Garofalak...