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...
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 ...
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 ...
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...
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...