Sciweavers

3110 search results - page 107 / 622
» On the initialization of the DNMF algorithm
Sort
View
FOCS
1999
IEEE
15 years 9 months ago
A Probabilistic Algorithm for k-SAT and Constraint Satisfaction Problems
We present a simple probabilistic algorithm for solving kSAT, and more generally, for solving constraint satisfaction problems (CSP). The algorithm follows a simple localsearch pa...
Uwe Schöning
EVOW
2007
Springer
15 years 8 months ago
Evaluating Evolutionary Algorithms and Differential Evolution for the Online Optimization of Fermentation Processes
Abstract. Although important contributions have been made in recent years within the field of bioprocess model development and validation, in many cases the utility of even relativ...
Miguel Rocha, José P. Pinto, Isabel Rocha, ...
128
Voted
SODA
2001
ACM
87views Algorithms» more  SODA 2001»
15 years 6 months ago
Gossip is synteny: incomplete gossip and an exact algorithm for syntenic distance
The syntenic distance between two genomes is given by the minimum number of fusions, fissions, and translocations required to transform one into the other, ignoring the order of g...
David Liben-Nowell
CEC
2010
IEEE
15 years 6 months ago
Geometric Nelder-Mead Algorithm for the permutation representation
The Nelder-Mead Algorithm (NMA) is an almost half-century old method for numerical optimization, and it is a close relative of Particle Swarm Optimization (PSO) and Differential Ev...
Alberto Moraglio, Julian Togelius
VLDB
2009
ACM
159views Database» more  VLDB 2009»
16 years 5 months ago
Anytime measures for top-k algorithms on exact and fuzzy data sets
Top-k queries on large multi-attribute data sets are fundamental operations in information retrieval and ranking applications. In this article, we initiate research on the anytime ...
Benjamin Arai, Gautam Das, Dimitrios Gunopulos, Ni...