Sciweavers

1052 search results - page 181 / 211
» Understanding POWER multiprocessors
Sort
View
SOSP
2009
ACM
14 years 5 months ago
Modular data storage with Anvil
Databases have achieved orders-of-magnitude performance improvements by changing the layout of stored data – for instance, by arranging data in columns or compressing it before ...
Mike Mammarella, Shant Hovsepian, Eddie Kohler
TLDI
2010
ACM
247views Formal Methods» more  TLDI 2010»
14 years 5 months ago
F-ing modules
ML modules are a powerful language mechanism for decomposing programs into reusable components. Unfortunately, they also have a reputation for being “complex” and requiring fa...
Andreas Rossberg, Claudio V. Russo, Derek Dreyer
WEA
2010
Springer
289views Algorithms» more  WEA 2010»
14 years 3 months ago
Experiments with a Generic Dantzig-Wolfe Decomposition for Integer Programs
Abstract We report on experiments with turning the branch-price-andcut framework SCIP into a generic branch-price-and-cut solver. That is, given a mixed integer program (MIP), our ...
Gerald Gamrath, Marco E. Lübbecke
ASUNAM
2009
IEEE
14 years 3 months ago
Dynamics of Inter-Meeting Time in Human Contact Networks
—We envision new communication paradigms, using physical dynamic interconnectedness among people. Delay Tolerant Networks (DTNs) are a new communication paradigm to support such ...
Eiko Yoneki, Dan Greenfield, Jon Crowcroft
WWW
2009
ACM
14 years 3 months ago
Tagommenders: connecting users to items through tags
Tagging has emerged as a powerful mechanism that enables users to find, organize, and understand online entities. Recommender systems similarly enable users to efficiently navig...
Shilad Sen, Jesse Vig, John Riedl