Sciweavers

399 search results - page 34 / 80
» Parallel evolutionary algorithms can achieve super-linear pe...
Sort
View
GECCO
2007
Springer
258views Optimization» more  GECCO 2007»
13 years 11 months ago
TFBS identification by position- and consensus-led genetic algorithm with local filtering
Identification of Transcription Factor Binding Site (TFBS) motifs in multiple DNA upstream sequences is important in understanding the mechanism of gene regulation. This identific...
Tak-Ming Chan, Kwong-Sak Leung, Kin-Hong Lee
GRID
2003
Springer
14 years 25 days ago
Predicting the Performance of Globus Monitoring and Discovery Service (MDS-2) Queries
Resource discovery and monitoring in a distributed Grid environment gives rise to several issues, one of which is the provision of reliable performance and hence, the quality-ofse...
Helene N. Lim Choi Keung, Justin R. D. Dyson, Step...
VLSID
2001
IEEE
164views VLSI» more  VLSID 2001»
14 years 8 months ago
An Efficient Parallel Transparent Bist Method For Multiple Embedded Memory Buffers
In this paper, we propose a new transparent built-in self-test ( TBIST ) method to test multiple embedded memory arrays with various sizes in parallel. First, a new transparent tes...
Der-Cheng Huang, Wen-Ben Jone, Sunil R. Das
SPAA
2010
ACM
14 years 13 days ago
Implementing and evaluating nested parallel transactions in software transactional memory
Transactional Memory (TM) is a promising technique that simplifies parallel programming for shared-memory applications. To date, most TM systems have been designed to efficientl...
Woongki Baek, Nathan Grasso Bronson, Christos Kozy...
FGCS
2010
119views more  FGCS 2010»
13 years 6 months ago
Characterizing fault tolerance in genetic programming
Evolutionary Algorithms, including Genetic Programming (GP), are frequently employed to solve difficult real-life problems, which can require up to days or months of computation. ...
Daniel Lombraña Gonzalez, Francisco Fern&aa...