Sciweavers

575 search results - page 114 / 115
» Computing Maximum Subsequence in Parallel
Sort
View
GECCO
2007
Springer
179views Optimization» more  GECCO 2007»
13 years 12 months ago
A destructive evolutionary process: a pilot implementation
This paper describes the application of evolutionary search to the problem of Flash memory wear-out. The operating parameters of Flash memory are notoriously difficult to determin...
Joe Sullivan, Conor Ryan
MIDDLEWARE
2007
Springer
13 years 12 months ago
Got predictability?: experiences with fault-tolerant middleware
Unpredictability in COTS-based systems often manifests as occasional instances of uncontrollably-high response times. A particular category of COTS systems, fault-tolerant (FT) mid...
Tudor Dumitras, Priya Narasimhan
RTCSA
2006
IEEE
13 years 11 months ago
Instruction Scheduling with Release Times and Deadlines on ILP Processors
ILP (Instruction Level Parallelism) processors are being increasingly used in embedded systems. In embedded systems, instructions may be subject to timing constraints. An optimisi...
Hui Wu, Joxan Jaffar, Jingling Xue
ASPLOS
2010
ACM
13 years 8 months ago
Decoupling contention management from scheduling
Many parallel applications exhibit unpredictable communication between threads, leading to contention for shared objects. The choice of contention management strategy impacts stro...
Ryan Johnson, Radu Stoica, Anastasia Ailamaki, Tod...
BMCBI
2008
130views more  BMCBI 2008»
13 years 5 months ago
IDEA: Interactive Display for Evolutionary Analyses
Background: The availability of complete genomic sequences for hundreds of organisms promises to make obtaining genome-wide estimates of substitution rates, selective constraints ...
Amy Egan, Anup Mahurkar, Jonathan Crabtree, Jonath...