Sciweavers

10988 search results - page 58 / 2198
» Algorithmic Folding Complexity
Sort
View
DISOPT
2006
155views more  DISOPT 2006»
13 years 9 months ago
Cyclical scheduling and multi-shift scheduling: Complexity and approximation algorithms
We consider the multiple shift scheduling problem modelled as a covering problem. Such problems are characterized by a constraint matrix that has in every column blocks of consecu...
Dorit S. Hochbaum, Asaf Levin
CORR
2006
Springer
87views Education» more  CORR 2006»
13 years 9 months ago
Low Complexity Algorithms for Linear Recurrences
We consider two kinds of problems: the computation of polynomial and rational solutions of linear recurrences with coefficients that are polynomials with integer coefficients; ind...
Alin Bostan, Frédéric Chyzak, Bruno ...
DAM
1999
119views more  DAM 1999»
13 years 8 months ago
On the Algorithmic Complexity of Twelve Covering and Independence Parameters of Graphs
The definitions of four previously studied parameters related to total coverings and total matchings of graphs can be restricted, thereby obtaining eight parameters related to cov...
David Manlove
CEC
2005
IEEE
14 years 2 months ago
A genetic algorithm for energy minimization in bio-molecular systems
Energy minimization algorithms for bio-molecular systems are critical to applications such as the prediction of protein folding. Conventional energy minimization methods such as th...
Xiaochun Weng, Lutz Hamel, Lenore M. Martin, Joan ...
EUROCRYPT
2012
Springer
11 years 11 months ago
Improving the Complexity of Index Calculus Algorithms in Elliptic Curves over Binary Fields
Abstract. The goal of this paper is to further study the index calculus method that was first introduced by Semaev for solving the ECDLP and later developed by Gaudry and Diem. In...
Jean-Charles Faugère, Ludovic Perret, Chris...