Sciweavers

12265 search results - page 420 / 2453
» Knuth-Morris-Pratt Algorithm: An Analysis
Sort
View
GECCO
2006
Springer
159views Optimization» more  GECCO 2006»
15 years 10 months ago
Identification of weak motifs in multiple biological sequences using genetic algorithm
Recognition of motifs in multiple unaligned sequences provides an insight into protein structure and function. The task of discovering these motifs is very challenging because mos...
Topon Kumar Paul, Hitoshi Iba
EDBT
2010
ACM
155views Database» more  EDBT 2010»
15 years 10 months ago
Suffix tree construction algorithms on modern hardware
Suffix trees are indexing structures that enhance the performance of numerous string processing algorithms. In this paper, we propose cache-conscious suffix tree construction algo...
Dimitris Tsirogiannis, Nick Koudas
ATAL
2008
Springer
15 years 8 months ago
Comparing winner determination algorithms for mixed multi-unit combinatorial auctions
Mixed multi-unit combinatorial auctions are combinatorial auctions in which the auctioneer and the bidders negotiate over transformations rather than over simple goods. By proposi...
Brammert Ottens, Ulle Endriss
NETWORKING
2010
15 years 8 months ago
Efficient Recovery from False State in Distributed Routing Algorithms
Abstract--Malicious and misconfigured nodes can inject incorrect state into a distributed system, which can then be propagated system-wide as a result of normal network operation. ...
Daniel Gyllstrom, Sudarshan Vasudevan, Jim Kurose,...
ML
2006
ACM
142views Machine Learning» more  ML 2006»
15 years 6 months ago
The max-min hill-climbing Bayesian network structure learning algorithm
We present a new algorithm for Bayesian network structure learning, called Max-Min Hill-Climbing (MMHC). The algorithm combines ideas from local learning, constraint-based, and sea...
Ioannis Tsamardinos, Laura E. Brown, Constantin F....