Sciweavers

14739 search results - page 149 / 2948
» An optimization problem on the sphere
Sort
View
VLDB
2002
ACM
157views Database» more  VLDB 2002»
15 years 10 months ago
A formal perspective on the view selection problem
The view selection problem is to choose a set of views to materialize over a database schema, such that the cost of evaluating a set of workload queries is minimized and such that ...
Rada Chirkova, Alon Y. Halevy, Dan Suciu
GECCO
2009
Springer
119views Optimization» more  GECCO 2009»
15 years 3 months ago
Cooperative micro-differential evolution for high-dimensional problems
High–dimensional optimization problems appear very often in demanding applications. Although evolutionary algorithms constitute a valuable tool for solving such problems, their ...
Konstantinos E. Parsopoulos
GECCO
2007
Springer
193views Optimization» more  GECCO 2007»
15 years 4 months ago
Approximating covering problems by randomized search heuristics using multi-objective models
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...
Tobias Friedrich, Nils Hebbinghaus, Frank Neumann,...
ECCV
2006
Springer
15 years 2 months ago
Trace Quotient Problems Revisited
The formulation of trace quotient is shared by many computer vision problems; however, it was conventionally approximated by an essentially different formulation of quotient trace,...
Shuicheng Yan, Xiaoou Tang
FSTTCS
2004
Springer
15 years 4 months ago
Improved Approximation Algorithms for Maximum Graph Partitioning Problems
Abstract Abstract. In this paper we improve the analysis of approximation algorithms based on semidefinite programming for the maximum graph partitioning problems MAX-k-CUT, MAX-k...
Gerold Jäger, Anand Srivastav