Sciweavers

613 search results - page 117 / 123
» The Memory Fragmentation Problem: Solved
Sort
View
ATAL
2009
Springer
15 years 9 months ago
Computing optimal randomized resource allocations for massive security games
Predictable allocations of security resources such as police officers, canine units, or checkpoints are vulnerable to exploitation by attackers. Recent work has applied game-theo...
Christopher Kiekintveld, Manish Jain, Jason Tsai, ...
164
Voted
SPAA
1997
ACM
15 years 6 months ago
A Localized Algorithm for Parallel Association Mining
Discovery of association rules is an important database mining problem. Mining for association rules involves extracting patterns from large databases and inferring useful rules f...
Mohammed Javeed Zaki, Srinivasan Parthasarathy, We...
124
Voted
IPPS
1996
IEEE
15 years 6 months ago
Practical Parallel Algorithms for Dynamic Data Redistribution, Median Finding, and Selection
A common statistical problem is that of nding the median element in a set of data. This paper presents a fastand portable parallel algorithm for nding the median given a set of el...
David A. Bader, Joseph JáJá
EMSOFT
2008
Springer
15 years 4 months ago
Workload-based configuration of MEMS-based storage devices for mobile systems
Because of its small form factor, high capacity, and expected low cost, MEMS-based storage is a suitable storage technology for mobile systems. However, flash memory may outperfor...
Mohammed G. Khatib, Ethan L. Miller, Pieter H. Har...
BMCBI
2010
198views more  BMCBI 2010»
15 years 2 months ago
ClustalXeed: a GUI-based grid computation version for high performance and terabyte size multiple sequence alignment
Background: There is an increasing demand to assemble and align large-scale biological sequence data sets. The commonly used multiple sequence alignment programs are still limited...
Taeho Kim, Hyun Joo