Sciweavers

2635 search results - page 43 / 527
» Algorithms for the Database Layout Problem
Sort
View
100
Voted
VISSYM
2007
15 years 4 months ago
Grouse: Feature-Based, Steerable Graph Hierarchy Exploration
Grouse is a feature-based approach to steerable exploration of a graph and an associated hierarchy. Steerability allows exploration to begin immediately, rather than requiring a c...
Daniel Archambault, Tamara Munzner, David Auber
PROCEDIA
2010
113views more  PROCEDIA 2010»
15 years 27 days ago
Exploring utilisation of GPU for database applications
This study is devoted to exploring possible applications of GPU technology for acceleration of the database access. We use the n-gram based approximate text search engine as a tes...
Slawomir Walkowiak, Konrad Wawruch, Marita Nowotka...
GECCO
2009
Springer
15 years 7 months ago
The sensitivity of HyperNEAT to different geometric representations of a problem
HyperNEAT, a generative encoding for evolving artificial neural networks (ANNs), has the unique and powerful ability to exploit the geometry of a problem (e.g., symmetries) by enc...
Jeff Clune, Charles Ofria, Robert T. Pennock
116
Voted
ANOR
2010
112views more  ANOR 2010»
15 years 2 months ago
The Multi-Story Space Assignment Problem
-- The Multi-Story Space Assignment Problem (MSAP) is an innovative formulation of the multi-story facility assignment problem that allows one to model the location of departments ...
Peter M. Hahn, J. MacGregor Smith, Yi-Rong Zhu
PODS
2006
ACM
104views Database» more  PODS 2006»
16 years 2 months ago
Tractable database design through bounded treewidth
Given that most elementary problems in database design are NP-hard, the currently used database design algorithms produce suboptimal results. For example, the current 3NF decompos...
Georg Gottlob, Reinhard Pichler, Fang Wei