Sciweavers

1996 search results - page 181 / 400
» Financial Theory 2
Sort
View
GECCO
2008
Springer
124views Optimization» more  GECCO 2008»
15 years 5 months ago
Runtime analysis of binary PSO
We investigate the runtime of the Binary Particle Swarm Optimization (PSO) algorithm introduced by Kennedy and Eberhart (1997). The Binary PSO maintains a global best solution and...
Dirk Sudholt, Carsten Witt
COMBINATORICA
2008
84views more  COMBINATORICA 2008»
15 years 4 months ago
Parity check matrices and product representations of squares
Let NF(n, k, r) denote the maximum number of columns in an n-row matrix with entries in a finite field F in which each column has at most r nonzero entries and every k columns are...
Assaf Naor, Jacques Verstraëte
FSS
2008
87views more  FSS 2008»
15 years 4 months ago
Representing parametric probabilistic models tainted with imprecision
Numerical possibility theory, belief function have been suggested as useful tools to represent imprecise, vague or incomplete information. They are particularly appropriate in unc...
Cédric Baudrit, Didier Dubois, Nathalie Per...
CORR
2006
Springer
148views Education» more  CORR 2006»
15 years 4 months ago
Budget Optimization in Search-Based Advertising Auctions
Internet search companies sell advertisement slots based on users' search queries via an auction. While there has been previous work on the auction process and its game-theor...
Jon Feldman, S. Muthukrishnan, Martin Pál, ...
CORR
2006
Springer
120views Education» more  CORR 2006»
15 years 4 months ago
Improved Bounds and Schemes for the Declustering Problem
Abstract. The declustering problem is to allocate given data on parallel working storage devices in such a manner that typical requests find their data evenly distributed among the...
Benjamin Doerr, Nils Hebbinghaus, Sören Werth