Sciweavers

3422 search results - page 531 / 685
» Random Subset Optimization
Sort
View
PLDI
1995
ACM
15 years 6 months ago
Selective Specialization for Object-Oriented Languages
Dynamic dispatching is a major source of run-time overhead in object-oriented languages, due both to the direct cost of method lookup and to the indirect effect of preventing othe...
Jeffrey Dean, Craig Chambers, David Grove
GECCO
2008
Springer
121views Optimization» more  GECCO 2008»
15 years 4 months ago
Fast rule representation for continuous attributes in genetics-based machine learning
Genetic-Based Machine Learning Systems (GBML) are comparable in accuracy with other learning methods. However, efficiency is a significant drawback. This paper presents a new rep...
Jaume Bacardit, Natalio Krasnogor
GECCO
2008
Springer
184views Optimization» more  GECCO 2008»
15 years 4 months ago
Analysis of mammography reports using maximum variation sampling
A genetic algorithm (GA) was developed to implement a maximum variation sampling technique to derive a subset of data from a large dataset of unstructured mammography reports. It ...
Robert M. Patton, Barbara G. Beckerman, Thomas E. ...
BMCBI
2007
147views more  BMCBI 2007»
15 years 3 months ago
MaxAlign: maximizing usable data in an alignment
Background: The presence of gaps in an alignment of nucleotide or protein sequences is often an inconvenience for bioinformatical studies. In phylogenetic and other analyses, for ...
Rodrigo Gouveia-Oliveira, Peter Wad Sackett, Ander...
CORR
2010
Springer
120views Education» more  CORR 2010»
15 years 3 months ago
How Much Multiuser Diversity is Required for Energy Limited Multiuser Systems?
Multiuser diversity (MUDiv) is one of the central concepts in multiuser (MU) systems. In particular, MUDiv allows for scheduling among users in order to eliminate the negative effe...
Youngwook Ko, Sergiy A. Vorobyov, Masoud Ardakani