Sciweavers

5316 search results - page 281 / 1064
» Which Search Problems Are Random
Sort
View
BIRD
2008
Springer
177views Bioinformatics» more  BIRD 2008»
15 years 7 months ago
Fast Structured Motif Search in DNA Sequences
We study the problem of structured motif search in DNA sequences. This is a fundamental task in bioinformatics which contributes to better understanding of genome characteristics a...
Mihail Halachev, Nematollaah Shiri
PROMISE
2010
14 years 11 months ago
The relationship between search based software engineering and predictive modeling
Search Based Software Engineering (SBSE) is an approach to software engineering in which search based optimization algorithms are used to identify optimal or near optimal solution...
Mark Harman
116
Voted
ESWS
2009
Springer
15 years 11 months ago
Reducing Ambiguity in Tagging Systems with Folksonomy Search Expansion
Abstract. Search facilities are vital for folksonomy (or social tagging mechanism) based systems. Although these systems allow great malleability and adaptability, they also surfer...
Jeff Z. Pan, Stuart Taylor, Edward Thomas
ALGORITHMICA
2000
161views more  ALGORITHMICA 2000»
15 years 4 months ago
Binary Searching with Nonuniform Costs and Its Application to Text Retrieval
We study the problem of minimizing the expected cost of binary searching for data where the access cost is not fixed and depends on the last accessed element, such as data stored i...
Gonzalo Navarro, Ricardo A. Baeza-Yates, Eduardo F...
CEC
2008
IEEE
15 years 11 months ago
Examination of multi-objective optimization method for global search using DIRECT and GA
— A number of multi-objective genetic algorithms (MOGAs) have been developed to obtain Pareto optimal solutions for multi-objective optimization problems. However, as these metho...
Luyi Wang, Hiroyuki Ishida, Tomoyuki Hiroyasu, Mit...