Sciweavers

269 search results - page 19 / 54
» random 2001
Sort
View
EUROGP
2001
Springer
103views Optimization» more  EUROGP 2001»
14 years 2 months ago
Computational Complexity, Genetic Programming, and Implications
Recent theory work has shown that a Genetic Program (GP) used to produce programs may have output that is bounded above by the GP itself [l]. This paper presents proofs that show t...
Bart Rylander, Terence Soule, James A. Foster
STOC
2001
ACM
97views Algorithms» more  STOC 2001»
14 years 10 months ago
Sharp threshold and scaling window for the integer partitioning problem
We consider the problem of partitioning n integers chosen randomly between 1 and 2m into two subsets such that the discrepancy, the absolute value of the difference of their sums,...
Christian Borgs, Jennifer T. Chayes, Boris Pittel
EUSFLAT
2001
13 years 11 months ago
Reduction to independent variables: from normal distribution to general statistical case to fuzzy
In many practical problems, we must combine ("fuse") data represented in different formats, e.g., statistical, fuzzy, etc. The simpler the data, the easier to combine th...
Mourad Oussalah, Hung T. Nguyen, Vladik Kreinovich
STOC
2001
ACM
138views Algorithms» more  STOC 2001»
14 years 10 months ago
Fast computation of low rank matrix
Given a matrix A, it is often desirable to find a good approximation to A that has low rank. We introduce a simple technique for accelerating the computation of such approximation...
Dimitris Achlioptas, Frank McSherry
ASPDAC
2001
ACM
94views Hardware» more  ASPDAC 2001»
14 years 1 months ago
On speeding up extended finite state machines using catalyst circuitry
We propose a timing optimization technique for a complex finite state machine that consists of not only random logic but also data operators. In such a design, the timing critical...
Shi-Yu Huang