CORR
2004
Springer
13 years 4 months ago
2004
Springer
We survey results on the hardness of approximating combinatorial optimization problems. Contents
CORR
2004
Springer
13 years 4 months ago
2004
Springer
: The Game of Life cellular automaton is a classical example of a massively parallel collision-based computing device. The automaton exhibits mobile patterns, gliders, and generato...
CORR
2004
Springer
13 years 4 months ago
2004
Springer
CORR
2004
Springer
13 years 4 months ago
2004
Springer
Maximum-likelihood decoding is one of the central algorithmic problems in coding theory. It has been known for over 25 years that maximum-likelihood decoding of general linear cod...
CORR
2004
Springer
13 years 4 months ago
2004
Springer
In this paper, we use resource-bounded dimension theory to investigate polynomial size circuits. We show that for every i 0, P/poly has ith-order scaled p3 -strong dimension 0. W...
CORR
2004
Springer
13 years 4 months ago
2004
Springer
In the paper we de
CORR
2004
Springer
13 years 4 months ago
2004
Springer
Consider the problem of tracking a set of moving targets. Apart from the tracking result, it is often important to know where the tracking fails, either to steer sensors to that p...
CORR
2004
Springer
13 years 4 months ago
2004
Springer
A careful analysis of conditioning in the Sleeping Beauty problem is done, using the formal model for reasoning about knowledge and probability developed by Halpern and Tuttle. Wh...
CORR
2004
Springer
13 years 4 months ago
2004
Springer
CORR
2004
Springer
13 years 4 months ago
2004
Springer
Abstract-Boltzmann selectionis an important selection mechanism in evolutionary algorithms as it has theoretical properties which help in theoretical analysis. However, Boltzmann s...