Sciweavers

882 search results - page 121 / 177
» Local Search for Very Large SAT Problems
Sort
View
118
Voted
CAISE
2007
Springer
15 years 10 months ago
A Context-based Approach for Complex Semantic Matching
Semantic matching1 is a fundamental step in implementing data sharing applications. Most systems automating this task however limit themselves to finding simple (one-to-one) match...
Youssef Bououlid Idrissi, Julie Vachon
155
Voted
GECCO
2005
Springer
196views Optimization» more  GECCO 2005»
15 years 9 months ago
Breeding swarms: a new approach to recurrent neural network training
This paper shows that a novel hybrid algorithm, Breeding Swarms, performs equal to, or better than, Genetic Algorithms and Particle Swarm Optimizers when training recurrent neural...
Matthew Settles, Paul Nathan, Terence Soule
MINAR
1998
Springer
113views Multimedia» more  MINAR 1998»
15 years 8 months ago
Envelope Parameter Calculation of Similarity Indexing Structure
SimilarityIndexing is very importantfor content-basedretrieval on large multimedia databases, and the "tightness"of data set envelope is a factor that influences the perf...
Xuesheng Bai, Guangyou Xu, Yuanchun Shi
ECAI
2004
Springer
15 years 7 months ago
Avoiding Data Overfitting in Scientific Discovery: Experiments in Functional Genomics
Functional genomics is a typical scientific discovery domain characterized by a very large number of attributes (genes) relative to the number of examples (observations). The dang...
Dragan Gamberger, Nada Lavrac
CDC
2009
IEEE
285views Control Systems» more  CDC 2009»
15 years 1 months ago
Adaptive randomized algorithm for finding eigenvector of stochastic matrix with application to PageRank
Abstract-- The problem of finding the eigenvector corresponding to the largest eigenvalue of a stochastic matrix has numerous applications in ranking search results, multi-agent co...
Alexander V. Nazin, Boris T. Polyak