1041 search results - page 3 / 209 » Randomizing Reductions of Search Problems |
CEC
2005
IEEE
15 years 5 months ago
2005
IEEE
Testing of VLSI circuits can cause generation of excessive heat which can damage the chips under test. In the random testing environment, high-performance CMOS circuits consume sig...
100
click to vote
FOCS
2006
IEEE
15 years 5 months ago
2006
IEEE
We convert cell-probe lower bounds for polynomial space into stronger lower bounds for near-linear space. Our technique applies to any lower bound proved through the richness meth...
GECCO
2005
Springer
15 years 5 months ago
2005
Springer
In this work we provide empirical evidence that shows how a variable-length genetic algorithm (GA) can naturally evolve shorter average size populations. This reduction in chromos...
AAAI
2007
15 years 1 months ago
2007
In a constraint optimization problem (COP), many feasible valuations lead to the same objective value. This often means a huge search space and poor performance in the propagation...
FOCS
2003
IEEE
15 years 4 months ago
2003
IEEE
We show that if an NP-complete problem has a non-adaptive self-corrector with respect to a samplable distribution then coNP is contained in NP/poly and the polynomial hierarchy co...