Sciweavers

1725 search results - page 59 / 345
» Relaxed genetic programming
Sort
View
APPROX
2010
Springer
147views Algorithms» more  APPROX 2010»
15 years 26 days ago
Approximate Lasserre Integrality Gap for Unique Games
In this paper, we investigate whether a constant round Lasserre Semi-definite Programming (SDP) relaxation might give a good approximation to the UNIQUE GAMES problem. We show tha...
Subhash Khot, Preyas Popat, Rishi Saket
CORR
2011
Springer
174views Education» more  CORR 2011»
14 years 3 months ago
Lift-and-Project Integrality Gaps for the Traveling Salesperson Problem
We study the lift-and-project procedures of Lov´asz-Schrijver and Sherali-Adams applied to the standard linear programming relaxation of the traveling salesperson problem with tr...
Thomas Watson
ESWS
2011
Springer
14 years 2 months ago
Optimizing Query Shortcuts in RDF Databases
The emergence of the Semantic Web has led to the creation of large semantic knowledge bases, often in the form of RDF databases. Improving the performance of RDF databases necessit...
Vicky Dritsou, Panos Constantopoulos, Antonios Del...
TIT
2008
122views more  TIT 2008»
14 years 11 months ago
An Efficient Pseudocodeword Search Algorithm for Linear Programming Decoding of LDPC Codes
Abstract--In linear programming (LP) decoding of a low-density parity-check (LDPC) code one minimizes a linear functional, with coefficients related to log-likelihood ratios, over ...
Michael Chertkov, Mikhail G. Stepanov
GECCO
2007
Springer
163views Optimization» more  GECCO 2007»
15 years 5 months ago
Exploring medical data using visual spaces with genetic programming and implicit functional mappings
Two medical data sets (Breast cancer and Colon cancer) are investigated within a visual data mining paradigm through the unsupervised construction of virtual reality spaces using ...
Julio J. Valdés, Robert Orchard, Alan J. Ba...