Sciweavers

721 search results - page 103 / 145
» On Generators of Random Quasigroup Problems
Sort
View
ML
2006
ACM
121views Machine Learning» more  ML 2006»
13 years 8 months ago
Model-based transductive learning of the kernel matrix
This paper addresses the problem of transductive learning of the kernel matrix from a probabilistic perspective. We define the kernel matrix as a Wishart process prior and construc...
Zhihua Zhang, James T. Kwok, Dit-Yan Yeung
TEC
2008
104views more  TEC 2008»
13 years 8 months ago
Coevolution of Fitness Predictors
Abstract--We present an algorithm that coevolves fitness predictors, optimized for the solution population, which reduce fitness evaluation cost and frequency, while maintaining ev...
Michael D. Schmidt, Hod Lipson
COMBINATORICS
2004
90views more  COMBINATORICS 2004»
13 years 8 months ago
Strings with Maximally Many Distinct Subsequences and Substrings
A natural problem in extremal combinatorics is to maximize the number of distinct subsequences for any length-n string over a finite alphabet ; this value grows exponentially, but...
Abraham Flaxman, Aram Wettroth Harrow, Gregory B. ...
CORR
2002
Springer
123views Education» more  CORR 2002»
13 years 8 months ago
Survey propagation: an algorithm for satisfiability
: We study the satisfiability of randomly generated formulas formed by M clauses of exactly K literals over N Boolean variables. For a given value of N the problem is known to be m...
Alfredo Braunstein, Marc Mézard, Riccardo Z...
IPSN
2011
Springer
12 years 11 months ago
Exploration of path space using sensor network geometry
In a sensor network there are many paths between a source and a destination. An efficient method to explore and navigate in the ‘path space’ can help many important routing p...
Ruirui Jiang, Xiaomeng Ban, Mayank Goswami, Wei Ze...