Sciweavers

6192 search results - page 1054 / 1239
» Structure benefits all
Sort
View
ESA
2004
Springer
129views Algorithms» more  ESA 2004»
16 years 17 days ago
Contraction and Treewidth Lower Bounds
Edge contraction is shown to be a useful mechanism to improve lower bound heuristics for treewidth. A successful lower bound for treewidth is the degeneracy: the maximum over all ...
Hans L. Bodlaender, Arie M. C. A. Koster, Thomas W...
GECCO
2004
Springer
134views Optimization» more  GECCO 2004»
16 years 16 days ago
Combining a Memetic Algorithm with Integer Programming to Solve the Prize-Collecting Steiner Tree Problem
The prize-collecting Steiner tree problem on a graph with edge costs and vertex profits asks for a subtree minimizing the sum of the total cost of all edges in the subtree plus th...
Gunnar W. Klau, Ivana Ljubic, Andreas Moser, Petra...
ICFCA
2004
Springer
16 years 16 days ago
BLID: An Application of Logical Information Systems to Bioinformatics
BLID (Bio-Logical Intelligent Database) is a bioinformatic system designed to help biologists extract new knowledge from raw genome data by providing high-level facilities for both...
Sébastien Ferré, Ross D. King
OOPSLA
2004
Springer
16 years 15 days ago
Finding your cronies: static analysis for dynamic object colocation
This paper introduces dynamic object colocation, an optimization to reduce copying costs in generational and other incremental garbage collectors by allocating connected objects t...
Samuel Z. Guyer, Kathryn S. McKinley
VLDB
2004
ACM
163views Database» more  VLDB 2004»
16 years 15 days ago
Compressing Large Boolean Matrices using Reordering Techniques
Large boolean matrices are a basic representational unit in a variety of applications, with some notable examples being interactive visualization systems, mining large graph struc...
David S. Johnson, Shankar Krishnan, Jatin Chhugani...
« Prev « First page 1054 / 1239 Last » Next »