Sciweavers

4377 search results - page 48 / 876
» Mass problems and randomness
Sort
View
CEC
2009
IEEE
14 years 7 months ago
Analysis of constant creation techniques on the binomial-3 problem with grammatical evolution
This paper studies the difference between Persistent Random Constants (PRC) and Digit Concatenation as methods for generating constants. It has been shown that certain problems hav...
Jonathan Byrne, Michael O'Neill, Erik Hemberg, Ant...
RANDOM
1999
Springer
15 years 2 months ago
Fast Approximate PCPs for Multidimensional Bin-Packing Problems
Abstract. We consider approximate PCPs for multidimensional bin-packing problems. In particular, we show how a verifier can be quickly convinced that a set of multidimensional blo...
Tugkan Batu, Ronitt Rubinfeld, Patrick White
SIAMDM
2008
118views more  SIAMDM 2008»
14 years 9 months ago
Ramsey-Type Problem for an Almost Monochromatic K4
In this short note we prove that there is a constant c such that every k-edge-coloring of the complete graph Kn with n 2ck contains a K4 whose edges receive at most two colors. Th...
Jacob Fox, Benny Sudakov
AUTOMATICA
2002
93views more  AUTOMATICA 2002»
14 years 9 months ago
A probabilistic framework for problems with real structured uncertainty in systems and control
The objective of this paper is twofold. First, the problem of generation of real random matrix samples with uniform distribution in structured (spectral) norm bounded sets is stud...
Giuseppe Carlo Calafiore, Fabrizio Dabbene
ESA
1995
Springer
126views Algorithms» more  ESA 1995»
15 years 1 months ago
The Online Transportation Problem
We present a poly-log-competitive deterministic online algorithm for the online transportation problem on hierarchically separated trees when the online algorithm has one extra se...
Bala Kalyanasundaram, Kirk Pruhs