Sciweavers

215 search results - page 5 / 43
» An Improvement of a Function Computing Normalizers for Permu...
Sort
View
GECCO
2008
Springer
109views Optimization» more  GECCO 2008»
13 years 8 months ago
Focused no free lunch theorems
Proofs and empirical evidence are presented which show that a subset of algorithms can have identical performance over a subset of functions, even when the subset of functions is ...
Darrell Whitley, Jonathan E. Rowe
JCSS
2008
80views more  JCSS 2008»
13 years 7 months ago
Improved bounds on sorting by length-weighted reversals
We study the problem of sorting binary sequences and permutations by length-weighted reversals. We consider a wide class of cost functions, namely f( ) = for all 0, where is the...
Michael A. Bender, Dongdong Ge, Simai He, Haodong ...
BMCBI
2006
123views more  BMCBI 2006»
13 years 7 months ago
Permutation test for periodicity in short time series data
Background: Periodic processes, such as the circadian rhythm, are important factors modulating and coordinating transcription of genes governing key metabolic pathways. Theoretica...
Andrey A. Ptitsyn, Sanjin Zvonic, Jeffrey M. Gimbl...
CADE
2002
Springer
14 years 8 months ago
Testing Satisfiability of CNF Formulas by Computing a Stable Set of Points
We show that a conjunctive normal form (CNF) formula F is unsatisfiable iff there is a set of points of the Boolean space that is stable with respect to F. So testing the satisfiab...
Eugene Goldberg
STOC
2005
ACM
158views Algorithms» more  STOC 2005»
14 years 8 months ago
Polynomial time quantum algorithm for the computation of the unit group of a number field
We present a quantum algorithm for the computation of the irrational period lattice of a function on Zn which is periodic in a relaxed sense. This algorithm is applied to compute t...
Arthur Schmidt, Ulrich Vollmer