Sciweavers

5331 search results - page 784 / 1067
» Algebraic Methods for Optimization Problems
Sort
View
CG
2005
Springer
15 years 6 months ago
Adaptive density estimation using an orthogonal series for global illumination
In Monte-Carlo photon-tracing methods energy-carrying particles are traced in an environment to generate hit points on object surfaces for simulating global illumination. The surf...
Kam Wah Wong, Wenping Wang
WEBI
2010
Springer
15 years 4 months ago
DSP: Robust Semi-supervised Dimensionality Reduction Using Dual Subspace Projections
High-dimensional data usually incur learning deficiencies and computational difficulties. We present a novel semi-supervised dimensionality reduction technique that embeds high-dim...
Su Yan, Sofien Bouaziz, Dongwon Lee
STOC
2009
ACM
160views Algorithms» more  STOC 2009»
16 years 7 months ago
CSP gaps and reductions in the lasserre hierarchy
We study integrality gaps for SDP relaxations of constraint satisfaction problems, in the hierarchy of SDPs defined by Lasserre. Schoenebeck [25] recently showed the first integra...
Madhur Tulsiani
IPPS
2000
IEEE
15 years 11 months ago
A General Parallel Simulated Annealing Library and its Application in Airline Industry
To solve real-world discrete optimization problems approximately metaheuristics such as simulated annealing and other local search methods are commonly used. For large instances o...
Georg Kliewer, Stefan Tschöke
GECCO
2010
Springer
158views Optimization» more  GECCO 2010»
15 years 10 months ago
Efficiently evolving programs through the search for novelty
A significant challenge in genetic programming is premature convergence to local optima, which often prevents evolution from solving problems. This paper introduces to genetic pro...
Joel Lehman, Kenneth O. Stanley