Sciweavers

15073 search results - page 275 / 3015
» Probabilistic algorithms for computing resultants
Sort
View
KES
2007
Springer
15 years 10 months ago
NBM and WNBM: Algorithms and Evaluation for Personalizing Information Retrieval in METIORE
The current Information Retrieval Systems return hundreds or thousands of documents in response to a query. Users consider only the first 20 or 30, but documents are often sorted a...
David Bueno, Ricardo Conejo, Amos David, Cristina ...
GECCO
2004
Springer
131views Optimization» more  GECCO 2004»
15 years 10 months ago
PolyEDA: Combining Estimation of Distribution Algorithms and Linear Inequality Constraints
Estimation of distribution algorithms (EDAs) are population-based heuristic search methods that use probabilistic models of good solutions to guide their search. When applied to co...
Jörn Grahl, Franz Rothlauf
CORR
2002
Springer
123views Education» more  CORR 2002»
15 years 4 months ago
Survey propagation: an algorithm for satisfiability
: We study the satisfiability of randomly generated formulas formed by M clauses of exactly K literals over N Boolean variables. For a given value of N the problem is known to be m...
Alfredo Braunstein, Marc Mézard, Riccardo Z...
BMCBI
2010
155views more  BMCBI 2010»
15 years 1 months ago
BrEPS: a flexible and automatic protocol to compute enzyme-specific sequence profiles for functional annotation
Background: Models for the simulation of metabolic networks require the accurate prediction of enzyme function. Based on a genomic sequence, enzymatic functions of gene products a...
Constantin Bannert, A. Welfle, C. aus dem Spring, ...
RECOMB
2004
Springer
16 years 4 months ago
Finding approximate tandem repeats in genomic sequences
An efficient algorithm is presented for detecting approximate tandem repeats in genomic sequences. The algorithm is based on a flexible statistical model which allows a wide range...
Ydo Wexler, Zohar Yakhini, Yechezkel Kashi, Dan Ge...