Sciweavers

5316 search results - page 318 / 1064
» Which Search Problems Are Random
Sort
View
CIBCB
2007
IEEE
15 years 11 months ago
Hybrid Architecture for Accelerating DNA Codeword Library Searching
-- A large and reliable DNA codeword library is the key to the success of DNA based computing. Searching for the set of reliable DNA codewords is an NP-hard problem, which can take...
Qinru Qiu, Daniel J. Burns, Qing Wu, Prakash Mukre
137
Voted
ECAI
2006
Springer
15 years 10 months ago
Phonetic Spelling and Heuristic Search
Abstract. We introduce a new approach to spellchecking for languages with extreme phonetic irregularities. The spelling for such languages can be significantly improved if knowledg...
Benno Stein, Daniel Curatolo
CSMR
2006
IEEE
15 years 9 months ago
Search-Based Software Maintenance
The high cost of software maintenance could potentially be greatly reduced by the automatic refactoring of object-oriented programs to increase their understandability, adaptabili...
Mark Kent O'Keeffe, Mel Ó Cinnéide
GLOBECOM
2009
IEEE
15 years 4 months ago
A Reactive Tabu Search Based Equalizer for Severely Delay-Spread UWB MIMO-ISI Channels
We propose a novel equalizer for ultrawideband (UWB) multiple-input multiple-output (MIMO) channels characterized by severe delay spreads. The proposed equalizer is based on reacti...
N. Srinidhi, Saif K. Mohammed, Ananthanarayanan Ch...
ISSTA
2004
ACM
16 years 13 days ago
Evolutionary testing in the presence of loop-assigned flags: a testability transformation approach
Evolutionary testing is an effective technique for automatically generating good quality test data. However, for structural testing, the technique degenerates to random testing i...
André Baresel, David Binkley, Mark Harman, ...