Sciweavers

1451 search results - page 145 / 291
» Finding People by Sampling
Sort
View
GECCO
2006
Springer
207views Optimization» more  GECCO 2006»
15 years 8 months ago
Both robust computation and mutation operation in dynamic evolutionary algorithm are based on orthogonal design
A robust dynamic evolutionary algorithm (labeled RODEA), where both the robust calculation and mutation operator are based on an orthogonal design, is proposed in this paper. Prev...
Sanyou Y. Zeng, Rui Wang, Hui Shi, Guang Chen, Hug...
BIBE
2001
IEEE
188views Bioinformatics» more  BIBE 2001»
15 years 8 months ago
Interrelated Two-way Clustering: An Unsupervised Approach for Gene Expression Data Analysis
DNA arrays can be used to measure the expression levels of thousands of genes simultaneously. Currently most research focuses on the interpretation of the meaning of the data. How...
Chun Tang, Li Zhang, Aidong Zhang, Murali Ramanath...
LREC
2010
142views Education» more  LREC 2010»
15 years 6 months ago
Partial Parsing as a Method to Expedite Dependency Annotation of a Hindi Treebank
The paper describes an approach to expedite the process of manual annotation of a Hindi dependency treebank which is currently under development. We propose a way by which consist...
Mridul Gupta, Vineet Yadav, Samar Husain, Dipti Mi...
SODA
2008
ACM
200views Algorithms» more  SODA 2008»
15 years 6 months ago
Clustering for metric and non-metric distance measures
We study a generalization of the k-median problem with respect to an arbitrary dissimilarity measure D. Given a finite set P, our goal is to find a set C of size k such that the s...
Marcel R. Ackermann, Johannes Blömer, Christi...
AAAI
2006
15 years 6 months ago
Incremental Least Squares Policy Iteration for POMDPs
We present a new algorithm, called incremental least squares policy iteration (ILSPI), for finding the infinite-horizon stationary policy for partially observable Markov decision ...
Hui Li, Xuejun Liao, Lawrence Carin