Sciweavers

4095 search results - page 562 / 819
» How to test a tree
Sort
View
142
Voted
SEKE
2010
Springer
15 years 1 months ago
Architecture-centric development and evolution processes for component-based software
Abstract--Component-based development focuses on compose and composition: abstract components (as wished) must be searched for and matched to existing component (as found). This se...
Huaxi (Yulin) Zhang, Christelle Urtado, Sylvain Va...
EDM
2009
110views Data Mining» more  EDM 2009»
15 years 1 months ago
Using Learning Decomposition and Bootstrapping with Randomization to Compare the Impact of Different Educational Interventions o
A basic question of instructional interventions is how effective it is in promoting student learning. This paper presents a study to determine the relative efficacy of different in...
Mingyu Feng, Joseph Beck, Neil T. Heffernan
GECCO
2009
Springer
148views Optimization» more  GECCO 2009»
15 years 1 months ago
Genetic programming for quantitative stock selection
We provide an overview of using genetic programming (GP) to model stock returns. Our models employ GP terminals (model decision variables) that are financial factors identified by...
Ying L. Becker, Una-May O'Reilly
ICCV
2009
IEEE
15 years 1 months ago
Local distance functions: A taxonomy, new algorithms, and an evaluation
We present a taxonomy for local distance functions where most existing algorithms can be regarded as approximations of the geodesic distance defined by a metric tensor. We categor...
Deva Ramanan, Simon Baker
COGSR
2011
71views more  COGSR 2011»
14 years 10 months ago
Psychological models of human and optimal performance in bandit problems
In bandit problems, a decision-maker must choose between a set of alternatives, each of which has a fixed but unknown rate of reward, to maximize their total number of rewards ov...
Michael D. Lee, Shunan Zhang, Miles Munro, Mark St...