Sciweavers

5316 search results - page 257 / 1064
» Which Search Problems Are Random
Sort
View
148
Voted
NIPS
2004
15 years 6 months ago
Analysis of a greedy active learning strategy
act out the core search problem of active learning schemes, to better understand the extent to which adaptive labeling can improve sample complexity. We give various upper and low...
Sanjoy Dasgupta
SIGMOD
2008
ACM
150views Database» more  SIGMOD 2008»
16 years 5 months ago
Query biased snippet generation in XML search
Snippets are used by almost every text search engine to complement ranking scheme in order to effectively handle user searches, which are inherently ambiguous and whose relevance ...
Yu Huang, Ziyang Liu, Yi Chen
165
Voted
BMCBI
2008
201views more  BMCBI 2008»
15 years 5 months ago
A copula method for modeling directional dependence of genes
Background: Genes interact with each other as basic building blocks of life, forming a complicated network. The relationship between groups of genes with different functions can b...
Jong-Min Kim, Yoon-Sung Jung, Engin A. Sungur, Kap...
134
Voted
GECCO
2000
Springer
15 years 8 months ago
Sampling Bias and Search Space Boundary Extension in Real Coded Genetic Algorithms
In Real coded genetic algorithms, some crossover operators do not work well on functions which have their optimum at the corner of the search space. To cope with this problem, we ...
Shigeyoshi Tsutsui
CEC
2009
IEEE
15 years 11 months ago
The multiobjective evolutionary algorithm based on determined weight and sub-regional search
— By dividing the multiobjective optimization of the decision space into several small regions, this paper proposes multi-objective optimization algorithm based on sub-regional s...
Hai-lin Liu, Xueqiang Li