Sciweavers

1068 search results - page 134 / 214
» Extremely randomized trees
Sort
View
GECCO
2007
Springer
192views Optimization» more  GECCO 2007»
15 years 4 months ago
A new crossover technique for Cartesian genetic programming
Genetic Programming was first introduced by Koza using tree representation together with a crossover technique in which random sub-branches of the parents' trees are swapped ...
Janet Clegg, James Alfred Walker, Julian Francis M...
109
Voted
FPL
2000
Springer
119views Hardware» more  FPL 2000»
15 years 4 months ago
A Self-Reconfigurable Gate Array Architecture
Abstract. This paper presents an innovative architecture for a reconfigurable device that allows single cycle context switching and single cycle random access to the unified on-chi...
Reetinder P. S. Sidhu, Sameer Wadhwa, Alessandro M...
DIALM
2008
ACM
135views Algorithms» more  DIALM 2008»
15 years 2 months ago
Symmetric range assignment with disjoint MST constraints
If V is a set of n points in the unit square [0, 1]2 , and if R : V + is an assignment of positive real numbers (radii) to to those points, define a graph G(R) as follows: {v, w}...
Eric Schmutz
DAIS
2010
15 years 2 months ago
gradienTv: Market-Based P2P Live Media Streaming on the Gradient Overlay
This paper presents gradienTv, a distributed, market-based approach to live streaming. In gradienTv, multiple streaming trees are constructed using a market-based approach, such th...
Amir H. Payberah, Jim Dowling, Fatemeh Rahimian, S...
81
Voted
IJCAI
2007
15 years 2 months ago
Automated Design of Multistage Mechanisms
Mechanism design is the study of preference aggregation protocols that work well in the face of self-interested agents. We present the first general-purpose techniques for automa...
Tuomas Sandholm, Vincent Conitzer, Craig Boutilier