Sciweavers

29 search results - page 4 / 6
» Applications of modern heuristic search methods to pattern s...
Sort
View
BMCBI
2010
122views more  BMCBI 2010»
13 years 5 months ago
Fast and accurate protein substructure searching with simulated annealing and GPUs
Background: Searching a database of protein structures for matches to a query structure, or occurrences of a structural motif, is an important task in structural biology and bioin...
Alex Stivala, Peter J. Stuckey, Anthony Wirth
BMCBI
2006
113views more  BMCBI 2006»
13 years 5 months ago
GibbsST: a Gibbs sampling method for motif discovery with enhanced resistance to local optima
Background: Computational discovery of transcription factor binding sites (TFBS) is a challenging but important problem of bioinformatics. In this study, improvement of a Gibbs sa...
Kazuhito Shida
HIPEAC
2010
Springer
14 years 2 months ago
Performance and Power Aware CMP Thread Allocation Modeling
We address the problem of performance and power-efficient thread allocation in a CMP. To that end, based on analytical model, we introduce a parameterized performance/power metric ...
Yaniv Ben-Itzhak, Israel Cidon, Avinoam Kolodny
AIPS
2010
13 years 5 months ago
The Scanalyzer Domain: Greenhouse Logistics as a Planning Problem
We introduce the Scanalyzer planning domain, a domain for classical planning which models the problem of automatic greenhouse logistic management. At its mathematical core, the Sc...
Malte Helmert, Hauke Lasinger
ICDM
2005
IEEE
168views Data Mining» more  ICDM 2005»
13 years 11 months ago
Discovering Frequent Arrangements of Temporal Intervals
In this paper we study a new problem in temporal pattern mining: discovering frequent arrangements of temporal intervals. We assume that the database consists of sequences of even...
Panagiotis Papapetrou, George Kollios, Stan Sclaro...