Sciweavers

2376 search results - page 443 / 476
» More Efficient Internal-Regret-Minimizing Algorithms
Sort
View
PDCN
2004
13 years 10 months ago
Speculative prefetching of optional locks in distributed systems
We present a family of methods for speeding up distributed locks by exploiting the uneven distribution of both temporal and spatial locality of access behaviour of many applicatio...
Thomas Schöbel-Theuer
BMCBI
2006
159views more  BMCBI 2006»
13 years 8 months ago
EpiJen: a server for multistep T cell epitope prediction
Background: The main processing pathway for MHC class I ligands involves degradation of proteins by the proteasome, followed by transport of products by the transporter associated...
Irini A. Doytchinova, Pingping Guan, Darren R. Flo...
ASPDAC
2007
ACM
98views Hardware» more  ASPDAC 2007»
14 years 24 days ago
Node Mergers in the Presence of Don't Cares
Abstract-- SAT sweeping is the process of merging two or more functionally equivalent nodes in a circuit by selecting one of them to represent all the other equivalent nodes. This ...
Stephen Plaza, Kai-Hui Chang, Igor L. Markov, Vale...
CGO
2006
IEEE
14 years 16 days ago
Profiling over Adaptive Ranges
Modern computer systems are called on to deal with billions of events every second, whether they are instructions executed, memory locations accessed, or packets forwarded. This p...
Shashidhar Mysore, Banit Agrawal, Timothy Sherwood...
GECCO
2006
Springer
195views Optimization» more  GECCO 2006»
14 years 14 days ago
Studying XCS/BOA learning in Boolean functions: structure encoding and random Boolean functions
Recently, studies with the XCS classifier system on Boolean functions have shown that in certain types of functions simple crossover operators can lead to disruption and, conseque...
Martin V. Butz, Martin Pelikan