Sciweavers

406 search results - page 77 / 82
» Database-friendly random projections
Sort
View
GECCO
2005
Springer
159views Optimization» more  GECCO 2005»
14 years 1 months ago
Using evolutionary algorithms for the unit testing of object-oriented software
As the paradigm of object orientation becomes more and more important for modern IT development projects, the demand for an automated test case generation to dynamically test obje...
Stefan Wappler, Frank Lammermann
IVA
2005
Springer
14 years 1 months ago
A Platform Independent Architecture for Virtual Characters and Avatars
this is via the ”Motion Abstraction”. This is a single abstraction that represents any type of animation of a character. Different implementations of the ion can provide very ...
M. Gillies, Vinoba Vinayagamoorthy, D. Robeterson,...
ASPLOS
2004
ACM
14 years 29 days ago
Software prefetching for mark-sweep garbage collection: hardware analysis and software redesign
Tracing garbage collectors traverse references from live program variables, transitively tracing out the closure of live objects. Memory accesses incurred during tracing are essen...
Chen-Yong Cher, Antony L. Hosking, T. N. Vijaykuma...
ESA
2004
Springer
129views Algorithms» more  ESA 2004»
14 years 27 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...
COMPGEOM
2003
ACM
14 years 23 days ago
The smallest enclosing ball of balls: combinatorial structure and algorithms
We develop algorithms for computing the smallest enclosing ball of a set of n balls in d-dimensional space. Unlike previous methods, we explicitly address small cases (n ≤ d + 1...
Kaspar Fischer, Bernd Gärtner