32 search results - page 5 / 7 » Relativizing Small Complexity Classes and Their Theories |
SIGECOM
2009
ACM
14 years 3 months ago
2009
ACM
We study the degree to which small fluctuations in costs in wellstudied potential games can impact the result of natural best-response and improved-response dynamics. We call thi...
GECCO
2007
Springer
14 years 2 months ago
2007
Springer
The main aim of randomized search heuristics is to produce good approximations of optimal solutions within a small amount of time. In contrast to numerous experimental results, th...
VLSID
2003
IEEE
14 years 1 months ago
2003
IEEE
— This paper reports a cryptosystem designed for security of embedded systems. It is based on the theory of Cellular Automata(CA). The Cellular Automata based Cryptosystem(CAC) e...
NIPS
2007
13 years 10 months ago
2007
Clustering is often formulated as a discrete optimization problem. The objective is to find, among all partitions of the data set, the best one according to some quality measure....
STOC
2009
ACM
14 years 9 months ago
2009
ACM
We design a linear time approximation scheme for the GaleBerlekamp Switching Game and generalize it to a wider class of dense fragile minimization problems including the Nearest C...