Sciweavers

12825 search results - page 382 / 2565
» Improved PLSOM algorithm
Sort
View
GECCO
2007
Springer
179views Optimization» more  GECCO 2007»
16 years 1 months ago
Genetic algorithms for large join query optimization
Genetic algorithms (GAs) have long been used for large join query optimization (LJQO). Previous work takes all queries as based on one granularity to optimize GAs and compares the...
Hongbin Dong, Yiwen Liang
186
Voted
TAMC
2007
Springer
16 years 1 months ago
Approximation Algorithms for 3D Orthogonal Knapsack
We study non-overlapping axis-parallel packings of 3D boxes with profits into a dedicated bigger box where rotation is either forbidden or permitted; we wish to maximize the total...
Florian Diedrich, Rolf Harren, Klaus Jansen, Ralf ...
FOCS
2003
IEEE
16 years 22 days ago
Approximation Algorithms for Asymmetric TSP by Decomposing Directed Regular Multigraphs
A directed multigraph is said to be d-regular if the indegree and outdegree of every vertex is exactly d. By Hall’s theorem one can represent such a multigraph as a combination ...
Haim Kaplan, Moshe Lewenstein, Nira Shafrir, Maxim...
ICAISC
2010
Springer
16 years 7 days ago
A New Implementation of the co-VAT Algorithm for Visual Assessment of Clusters in Rectangular Relational Data
This paper presents a new implementation of the co-VAT algorithm. We assume we have an m × n matrix D, where the elements of D are pair-wise dissimilarities between m row objects ...
Timothy C. Havens, James C. Bezdek, James M. Kelle...
ICALP
2010
Springer
16 years 7 days ago
Thresholded Covering Algorithms for Robust and Max-min Optimization
The general problem of robust optimization is this: one of several possible scenarios will appear tomorrow, but things are more expensive tomorrow than they are today. What should...
Anupam Gupta, Viswanath Nagarajan, R. Ravi