Sciweavers

1021 search results - page 89 / 205
» Model selection in genetic programming
Sort
View
CGO
2003
IEEE
14 years 2 months ago
Addressing Mode Selection
Many processor architectures provide a set of addressing modes in their address generation units. For example DSPs (digital signal processors) have powerful addressing modes for e...
Erik Eckstein, Bernhard Scholz
TALG
2010
74views more  TALG 2010»
13 years 7 months ago
Comparison-based time-space lower bounds for selection
We establish the first nontrivial lower bounds on timespace tradeoffs for the selection problem. We prove that any comparison-based randomized algorithm for finding the median ...
Timothy M. Chan
AIPS
2003
13 years 10 months ago
A Multi-Heuristic GA for Schedule Repair in Precast Plant Production
A multi-heuristic schedule repair model for schedule conflict resolution is presented and its application in repairing the schedules of a prefabrication plant is described in this...
Weng Tat Chan, Tan Heng Wee
ICSE
2001
IEEE-ACM
14 years 1 months ago
Encoding Program Executions
Dynamic analysis is based on collecting data as the program runs. However, raw traces tend to be too voluminous and too unstructured to be used directly for visualization and unde...
Steven P. Reiss, Manos Renieris
PKDD
2009
Springer
113views Data Mining» more  PKDD 2009»
14 years 3 months ago
Feature Selection for Density Level-Sets
A frequent problem in density level-set estimation is the choice of the right features that give rise to compact and concise representations of the observed data. We present an e...
Marius Kloft, Shinichi Nakajima, Ulf Brefeld