Sciweavers

5316 search results - page 330 / 1064
» Which Search Problems Are Random
Sort
View
CEC
2007
IEEE
15 years 11 months ago
Efficient assembling of genome fragments using genetic algorithm enhanced by heuristic search
Abstract-- Shotgun sequencing is the state-of-the-art to decode genome sequence. However this technique needs a lot of fragments. Combining those fragments correctly requires enorm...
Satoko Kikuchi, Goutam Chakraborty
AAAI
2008
15 years 9 months ago
Computing Minimal Diagnoses by Greedy Stochastic Search
Most algorithms for computing diagnoses within a modelbased diagnosis framework are deterministic. Such algorithms guarantee soundness and completeness, but are P 2 hard. To overc...
Alexander Feldman, Gregory M. Provan, Arjan J. C. ...
LREC
2008
132views Education» more  LREC 2008»
15 years 8 months ago
The Usage of Various Lexical Resources and Tools to Improve the Performance of Web Search Engines
In this paper we present how resources and tools developed within the Human Language Technology Group at the University of Belgrade can be used for tuning queries before submittin...
Cvetana Krstev, Ranka Stankovic, Dusko Vitas, Ivan...
ICEC
1994
37views more  ICEC 1994»
15 years 8 months ago
A Method for Utilizing Diploid/Dominance in Genetic Search
homologous alleles seemingly compete prior to manifestation in the observed phenotype, will be referred to as sub-phenotype interaction.A method is proposed for implementing diploi...
F. Greene
CIVR
2007
Springer
280views Image Analysis» more  CIVR 2007»
16 years 1 months ago
Demonstration of image retrieval based on illumination invariant textural MRF features
Content-based image retrieval (CBIR) systems target database images using feature similarities with respect to the query. Our CBIR demonstration utilises novel illumination invari...
Pavel Vacha, Michal Haindl