Sciweavers

1529 search results - page 200 / 306
» Search Space Analysis of the Linear Ordering Problem
Sort
View
GECCO
2011
Springer
232views Optimization» more  GECCO 2011»
14 years 7 months ago
Mutation rates of the (1+1)-EA on pseudo-boolean functions of bounded epistasis
When the epistasis of the fitness function is bounded by a constant, we show that the expected fitness of an offspring of the (1+1)-EA can be efficiently computed for any point...
Andrew M. Sutton, Darrell Whitley, Adele E. Howe
CVPR
2008
IEEE
16 years 6 months ago
On the use of independent tasks for face recognition
We present a method for learning discriminative linear feature extraction using independent tasks. More concretely, given a target classification task, we consider a complementary...
Àgata Lapedriza, David Masip, Jordi Vitri&a...
SIAMSC
2010
170views more  SIAMSC 2010»
14 years 10 months ago
Adaptive ADER Methods Using Kernel-Based Polyharmonic Spline WENO Reconstruction
An adaptive ADER finite volume method on unstructured meshes is proposed. The method combines high order polyharmonic spline WENO reconstruction with high order flux evaluation. Po...
Terhemen Aboiyar, Emmanuil H. Georgoulis, Armin Is...
JAR
2008
88views more  JAR 2008»
15 years 4 months ago
Using Theorem Proving to Verify Expectation and Variance for Discrete Random Variables
Statistical quantities, such as expectation (mean) and variance, play a vital role in the present age probabilistic analysis. In this paper, we present some formalization of expect...
Osman Hasan, Sofiène Tahar
INFOCOM
2006
IEEE
15 years 10 months ago
Theory and Network Applications of Dynamic Bloom Filters
Abstract— A bloom filter is a simple, space-efficient, randomized data structure for concisely representing a static data set, in order to support approximate membership querie...
Deke Guo, Jie Wu, Honghui Chen, Xueshan Luo