Sciweavers

190 search results - page 24 / 38
» Resources, Concurrency and Local Reasoning
Sort
View
RECSYS
2009
ACM
14 years 1 months ago
A partial-order based active cache for recommender systems
Recommender systems aim to substantially reduce information overload by suggesting lists of similar items that users may find interesting. Caching has been a useful technique for...
Umar Qasim, Vincent Oria, Yi-fang Brook Wu, Michae...
POPL
2005
ACM
14 years 7 months ago
Permission accounting in separation logic
A lightweight logical approach to race-free sharing of heap storage between concurrent threads is described, based on the notion of permission to access. Transfer of permission be...
Richard Bornat, Cristiano Calcagno, Peter W. O'Hea...
ICIW
2009
IEEE
14 years 2 months ago
An Adaptive Scheduling Policy for Staged Applications
The performance of Web servers and application servers is a crucial factor for the success of the underlying business activity. Current commercial servers (such as Apache and Micr...
Mohammad Shadi Al Hakeem, Jan Richling, Gero M&uum...
CONCURRENCY
2010
130views more  CONCURRENCY 2010»
13 years 7 months ago
Enabling high-speed asynchronous data extraction and transfer using DART
As the complexity and scale of current scientific and engineering applications grow, managing and transporting the large amounts of data they generate is quickly becoming a signif...
Ciprian Docan, Manish Parashar, Scott Klasky
EVOW
2009
Springer
14 years 2 months ago
A Memetic Algorithm for Phylogenetic Reconstruction with Maximum Parsimony
The Maximum Parsimony problem aims at reconstructing a phylogenetic tree from DNA, RNA or protein sequences while minimizing the number of evolutionary changes. Much work has been ...
Jean-Michel Richer, Adrien Goëffon, Jin-Kao H...