Sciweavers

15485 search results - page 67 / 3097
» Computing Optimal Subsets
Sort
View
CORR
2011
Springer
135views Education» more  CORR 2011»
13 years 2 months ago
Planning with Partial Preference Models
In many real-world planning scenarios, the users are interested in optimizing multiple objectives (such as makespan and execution cost), but are unable to express their exact trad...
Tuan A. Nguyen, Minh Binh Do, Alfonso Gerevini, Iv...
CP
2011
Springer
12 years 7 months ago
Pruning Rules for Constrained Optimisation for Conditional Preferences
A depth-first search algorithm can be used to find optimal solutions of a Constraint Satisfaction Problem (CSP) with respect to a set of conditional preferences statements (e.g.,...
Nic Wilson, Walid Trabelsi
BMCBI
2005
94views more  BMCBI 2005»
13 years 7 months ago
A method for finding single-nucleotide polymorphisms with allele frequencies in sequences of deep coverage
Background: The allele frequencies of single-nucleotide polymorphisms (SNPs) are needed to select an optimal subset of common SNPs for use in association studies. Sequence-based m...
Jianmin Wang, Xiaoqiu Huang
GECCO
2009
Springer
112views Optimization» more  GECCO 2009»
14 years 9 days ago
Solving quadratic assignment problems by genetic algorithms with GPU computation: a case study
Ì × Ô Ô Ö × Ö × × Ò Ò Ô Ö ÐÐ Ð Û Ø ÈÍ Óѹ ÔÙØ Ø ÓÒ ØÓ ×ÓÐÚ Ø ÕÙ Ö Ø ×× ÒÑ ÒØ ÔÖÓ Ð Ñ ´É ȵ Û × ÓÒ Ó Ø Ö ×Ø ÓÔØ ...
Shigeyoshi Tsutsui, Noriyuki Fujimoto
GECCO
1999
Springer
241views Optimization» more  GECCO 1999»
13 years 12 months ago
Building a Parallel Computer System for $18, 000 that Performs a Half Peta-Flop per Day
Forrest H. Bennett III, John R. Koza, James Shipma...