Sciweavers

3758 search results - page 187 / 752
» A Complete Subsumption Algorithm
Sort
View
98
Voted
ATVA
2008
Springer
131views Hardware» more  ATVA 2008»
15 years 4 hour ago
Dynamic Model Checking with Property Driven Pruning to Detect Race Conditions
We present a new property driven pruning algorithm in dynamic model checking to efficiently detect race conditions in multithreaded programs. The main idea is to use a lockset base...
Chao Wang, Yu Yang, Aarti Gupta, Ganesh Gopalakris...
APPINF
2003
14 years 11 months ago
Fast Frequent Itemset Mining using Compressed Data Representation
Discovering association rules by identifying relationships among sets of items in a transaction database is an important problem in Data Mining. Finding frequent itemsets is compu...
Raj P. Gopalan, Yudho Giri Sucahyo
AAAI
2000
14 years 11 months ago
Depth-First Branch-and-Bound versus Local Search: A Case Study
Depth-first branch-and-bound (DFBnB) is a complete algorithm that is typically used to find optimal solutions of difficult combinatorial optimization problems. It can also be adap...
Weixiong Zhang
BMCBI
2011
14 years 4 months ago
Multithreaded comparative RNA secondary structure prediction using stochastic context-free grammars
Background: The prediction of the structure of large RNAs remains a particular challenge in bioinformatics, due to the computational complexity and low levels of accuracy of state...
Zsuzsanna Sukosd, Bjarne Knudsen, Morten Vaerum, J...
80
Voted
SODA
2010
ACM
197views Algorithms» more  SODA 2010»
15 years 7 months ago
Quasirandom Load Balancing
We propose a simple distributed algorithm for balancing indivisible tokens on graphs. The algorithm is completely deterministic, though it tries to imitate (and enhance) a random ...
Tobias Friedrich, Martin Gairing, Thomas Sauerwald