Sciweavers

Share
ECCC
2011
188views ECommerce» more  ECCC 2011»
8 years 7 months ago
Three Query Locally Decodable Codes with Higher Correctness Require Exponential Length
Locally decodable codes are error correcting codes with the extra property that, in order to retrieve the correct value of just one position of the input with high probability, it...
Anna Gál, Andrew Mills
ECCC
2011
205views ECommerce» more  ECCC 2011»
8 years 7 months ago
Graphs of Bounded Treewidth can be Canonized in AC1
In recent results the complexity of isomorphism testing on graphs of bounded treewidth is improved to TC1 [GV06] and further to LogCFL [DTW10]. The computation of canonical forms ...
Fabian Wagner
ECCC
2011
189views ECommerce» more  ECCC 2011»
8 years 7 months ago
Input-Oblivious Proof Systems and a Uniform Complexity Perspective on P/poly
An input-oblivious proof system is a proof system in which the proof does not depend on the claim being proved. Input-oblivious versions of NP and MA were introduced in passing by...
Oded Goldreich, Or Meir
ECCC
2011
223views ECommerce» more  ECCC 2011»
8 years 7 months ago
A Case of Depth-3 Identity Testing, Sparse Factorization and Duality
Polynomial identity testing (PIT) problem is known to be challenging even for constant depth arithmetic circuits. In this work, we study the complexity of two special but natural ...
Chandan Saha, Ramprasad Saptharishi, Nitin Saxena
ECCC
2011
234views ECommerce» more  ECCC 2011»
8 years 7 months ago
On the complexity of computational problems regarding distributions (a survey)
We consider two basic computational problems regarding discrete probability distributions: (1) approximating the statistical difference (aka variation distance) between two given d...
Oded Goldreich, Salil P. Vadhan
EC
2011
240views ECommerce» more  EC 2011»
8 years 7 months ago
HypE: An Algorithm for Fast Hypervolume-Based Many-Objective Optimization
Abstract—In the field of evolutionary multi-criterion optimization, the hypervolume indicator is the only single set quality measure that is known to be strictly monotonic with ...
Johannes Bader, Eckart Zitzler
EC
2011
262views ECommerce» more  EC 2011»
8 years 7 months ago
Computer-Automated Evolution of an X-Band Antenna for NASA's Space Technology 5 Mission
Whereas the current practice of designing antennas by hand is severely limited because it is both time and labor intensive and requires a significant amount of domain knowledge, ...
Gregory Hornby, Jason D. Lohn, Derek S. Linden
EC
2010
176views ECommerce» more  EC 2010»
8 years 9 months ago
Learning Factorizations in Estimation of Distribution Algorithms Using Affinity Propagation
Estimation of distribution algorithms (EDAs) that use marginal product model factorizations have been widely applied to a broad range of, mainly binary, optimization problems. In ...
Roberto Santana, Pedro Larrañaga, Jos&eacut...
EC
2010
127views ECommerce» more  EC 2010»
8 years 9 months ago
Representation Invariant Genetic Operators
A genetic algorithm is invariant with respect to a set of representations if it runs the same no matter which of the representations is used. We formalize this concept mathematica...
Jonathan E. Rowe, Michael D. Vose, Alden H. Wright
EC
2010
158views ECommerce» more  EC 2010»
8 years 9 months ago
An Efficient Algorithm for Computing Hypervolume Contributions
The hypervolume indicator serves as a sorting criterion in many recent multi-objective evolutionary algorithms (MOEAs). Typical algorithms remove the solution with the smallest lo...
Karl Bringmann, Tobias Friedrich
books