Sciweavers

1456 search results - page 273 / 292
» Two Techniques to Improve Finite Model Search
Sort
View
HPCA
2009
IEEE
14 years 8 months ago
A novel architecture of the 3D stacked MRAM L2 cache for CMPs
Magnetic Random Access Memory (MRAM) is considered to be a promising future memory technology due to its low leakage power, high density and fast read speed. The heterogeneous int...
Guangyu Sun, Xiangyu Dong, Yuan Xie, Jian Li, Yira...
FAST
2004
13 years 9 months ago
Circus: Opportunistic Block Reordering for Scalable Content Servers
Whole-file transfer is a basic primitive for Internet content dissemination. Content servers are increasingly limited by disk arm movement given the rapid growth in disk density, ...
Stergios V. Anastasiadis, Rajiv Wickremesinghe, Je...
AAAI
1994
13 years 9 months ago
Solution Reuse in Dynamic Constraint Satisfaction Problems
Many AI problems can be modeled as constraint satisfaction problems (CSP), but many of them are actually dynamic: the set of constraints to consider evolves because of the environ...
Gérard Verfaillie, Thomas Schiex
BMCBI
2007
134views more  BMCBI 2007»
13 years 7 months ago
Efficient pairwise RNA structure prediction using probabilistic alignment constraints in Dynalign
Background: Joint alignment and secondary structure prediction of two RNA sequences can significantly improve the accuracy of the structural predictions. Methods addressing this p...
Arif Ozgun Harmanci, Gaurav Sharma, David H. Mathe...
ASPLOS
2010
ACM
14 years 2 months ago
Request behavior variations
A large number of user requests execute (often concurrently) within a server system. A single request may exhibit fluctuating hardware characteristics (such as instruction comple...
Kai Shen