822 search results - page 85 / 165 » Contention in shared memory algorithms |
BMCBI
2010
13 years 9 months ago
2010
Background: In recent years, the demand for computational power in computational biology has increased due to rapidly growing data sets from microarray and other high-throughput t...
BMCBI
2010
13 years 9 months ago
2010
Background: Traditional algorithms for hidden Markov model decoding seek to maximize either the probability of a state path or the number of positions of a sequence assigned to th...
AI
2007
Springer
13 years 9 months ago
2007
Springer
The process of forming coalitions of software agents generally requires calculating a value for every possible coalition which indicates how beneficial that coalition would be if...
ICPP
1999
IEEE
1999
IEEE
Multi-Capacity Bin Packing Algorithms with Applications to Job Scheduling under Multiple Constraints
14 years 1 months ago
In past massively parallel processing systems, such as the TMC CM-5 and the CRI T3E, the scheduling problem consisted of allocating a single type of resource among the waiting job...
ATVA
2008
Springer
13 years 11 months ago
2008
Springer
We present a tool for parallel shared-memory enumerative LTL model-checking and reachability analysis. The tool is based on distributed-memory algorithms reimplemented specifically...