Sciweavers

1114 search results - page 45 / 223
» Better Construction with Factories
Sort
View
62
Voted
GECCO
2009
Springer
139views Optimization» more  GECCO 2009»
15 years 2 months ago
Meta-heuristics for reconstructing cross cut shredded text documents
In this work, we present two new approaches based on variable neighborhood search (VNS) and ant colony optimization (ACO) for the reconstruction of cross cut shredded text documen...
Matthias Prandtstetter, Günther R. Raidl
ICSE
1987
IEEE-ACM
15 years 1 months ago
Software Interconnection Models
We present a formulation of interconnection models and present the unit and syntactic models -- the primary models used for managing the evolution of large software systems. We di...
Dewayne E. Perry
SODA
1990
ACM
173views Algorithms» more  SODA 1990»
14 years 10 months ago
Suffix Arrays: A New Method for On-Line String Searches
A new and conceptually simple data structure, called a suffix array, for on-line string searches is introduced in this paper. Constructing and querying suffix arrays is reduced to...
Udi Manber, Gene Myers
STOC
2009
ACM
150views Algorithms» more  STOC 2009»
15 years 10 months ago
Integrality gaps for Sherali-Adams relaxations
We prove strong lower bounds on integrality gaps of Sherali?Adams relaxations for MAX CUT, Vertex Cover, Sparsest Cut and other problems. Our constructions show gaps for Sherali?A...
Moses Charikar, Konstantin Makarychev, Yury Makary...
81
Voted
ICANNGA
2007
Springer
100views Algorithms» more  ICANNGA 2007»
15 years 1 months ago
Softening Splits in Decision Trees Using Simulated Annealing
Predictions computed by a classification tree are usually constant on axis-parallel hyperrectangles corresponding to the leaves and have strict jumps on their boundaries. The densi...
Jakub Dvorák, Petr Savický