Sciweavers

2107 search results - page 77 / 422
» Computing Small Search Numbers in Linear Time
Sort
View
GECCO
2005
Springer
129views Optimization» more  GECCO 2005»
15 years 8 months ago
Evolutionary change in developmental timing
This paper presents a mutation-based evolutionary algorithm that evolves genotypic genes for regulating developmental timing of phenotypic values. The genotype sequentially genera...
Kei Ohnishi, Kaori Yoshida
ICPADS
2007
IEEE
15 years 9 months ago
Scheduling multiple divisible loads on a linear processor network
Min, Veeravalli, and Barlas have recently proposed strategies to minimize the overall execution time of one or several divisible loads on a heterogeneous linear network, using one...
Matthieu Gallet, Yves Robert, Frédér...
WWW
2011
ACM
14 years 10 months ago
Parallel boosted regression trees for web search ranking
Gradient Boosted Regression Trees (GBRT) are the current state-of-the-art learning paradigm for machine learned websearch ranking — a domain notorious for very large data sets. ...
Stephen Tyree, Kilian Q. Weinberger, Kunal Agrawal...
113
Voted
SIAMCOMP
1998
111views more  SIAMCOMP 1998»
15 years 2 months ago
Computing the Local Consensus of Trees
The inference of consensus from a set of evolutionary trees is a fundamental problem in a number of fields such as biology and historical linguistics, and many models for inferrin...
Sampath Kannan, Tandy Warnow
CVPR
2007
IEEE
16 years 5 months ago
Approximate Nearest Subspace Search with Applications to Pattern Recognition
Linear and affine subspaces are commonly used to describe appearance of objects under different lighting, viewpoint, articulation, and identity. A natural problem arising from the...
Ronen Basri, Tal Hassner, Lihi Zelnik-Manor