Sciweavers

JMLR
2010
225views more  JMLR 2010»
12 years 11 months ago
Hartigan's Method: k-means Clustering without Voronoi
Hartigan's method for k-means clustering is the following greedy heuristic: select a point, and optimally reassign it. This paper develops two other formulations of the heuri...
Matus Telgarsky, Andrea Vattani
EOR
2002
84views more  EOR 2002»
13 years 4 months ago
Solving container loading problems by block arrangement
In order to solve heterogeneous single and multiple container loading problems, an algorithm is presented that builds homogeneous blocks of identically orientated items. First a g...
Michael Eley
IPL
2007
74views more  IPL 2007»
13 years 4 months ago
Nonnegative integral subset representations of integer sets
We consider an integer-subset representation problem motivated by a medical application in radiation therapy. We prove NP-completeness, derive nontrivial bounds, and report on the...
Michael J. Collins, David Kempe, Jared Saia, Maxwe...
STRINGOLOGY
2004
13 years 5 months ago
Conditional Inequalities and the Shortest Common Superstring Problem
We investigate the shortest common superstring problem (SCSSP). As SCSSP is APX-complete it cannot be approximated within an arbitrarily small performance ratio. One heuristic tha...
Uli Laube, Maik Weinard
GECCO
2006
Springer
163views Optimization» more  GECCO 2006»
13 years 8 months ago
The quadratic multiple knapsack problem and three heuristic approaches to it
The quadratic multiple knapsack problem extends the quadratic knapsack problem with K knapsacks, each with its own capacity Ck. A greedy heuristic fills the knapsacks one at a tim...
Amanda Hiley, Bryant A. Julstrom
GECCO
2009
Springer
116views Optimization» more  GECCO 2009»
13 years 8 months ago
String- and permutation-coded genetic algorithms for the static weapon-target assignment problem
In the Weapon-Target Assignment Problem, m enemy targets are inbound, each with a value Vj representing the damage it may do. The defense has n weapons, and the probability that w...
Bryant A. Julstrom
COCOON
2009
Springer
13 years 8 months ago
Optimal Transitions for Targeted Protein Quantification: Best Conditioned Submatrix Selection
Multiple reaction monitoring (MRM) is a mass spectrometric method to quantify a specified set of proteins. In this paper, we identify a problem at the core of MRM peptide quantific...
Rastislav Srámek, Bernd Fischer, Elias Vica...
ICDCS
2000
IEEE
13 years 9 months ago
Static and Adaptive Data Replication Algorithms for Fast Information Access in Large Distributed Systems
Creating replicas of frequently accessed objects across a read-intensive network can result in large bandwidth savings which, in turn, can lead to reduction in user response time....
Thanasis Loukopoulos, Ishfaq Ahmad
GECCO
2004
Springer
13 years 10 months ago
Three Evolutionary Codings of Rectilinear Steiner Arborescences
A rectilinear Steiner arborescence connects points in the Euclidean plane’s first quadrant and the origin with directed rectilinear edges from the origin up and to the right. Th...
Bryant A. Julstrom, Athos Antoniades