Sciweavers

1989 search results - page 104 / 398
» cost 2010
Sort
View
ASE
2010
126views more  ASE 2010»
15 years 7 months ago
Generating a checking sequence with a minimum number of reset transitions
Given a finite state machine M, a checking sequence is an input sequence that is guaranteed to lead to a failure if the implementation under test is faulty and has no more states t...
Robert M. Hierons, Hasan Ural
BIB
2010
68views more  BIB 2010»
15 years 7 months ago
Genome variation discovery with high-throughput sequencing data
The advent of high-throughput sequencing (HTS) technologies is enabling sequencing of human genomes at a significantly lower cost. The availability of these genomes is hoped to en...
Adrian V. Dalca, Michael Brudno
CEE
2010
70views more  CEE 2010»
15 years 7 months ago
An iterative linearised solution to the sinusoidal parameter estimation problem
Signal processing applications use sinusoidal modelling for speech synthesis, speech coding, and audio coding. Estimation of the model parameters involves non-linear optimisation ...
Jean-Marc Valin, Daniel V. Smith, Christopher Mont...
COR
2010
152views more  COR 2010»
15 years 7 months ago
Variable neighborhood search for the dial-a-ride problem
In dial-a-ride problems passengers have to be transported between pre-specified pickup and delivery locations under user inconvenience considerations. The problem variant consider...
Sophie N. Parragh, Karl F. Doerner, Richard F. Har...
DAM
2010
79views more  DAM 2010»
15 years 7 months ago
On the sum minimization version of the online bin covering problem
Given a set of m identical bins of size 1, the online input consists of a (potentially, infinite) stream of items in (0, 1]. Each item is to be assigned to a bin upon arrival. The ...
János Csirik, Leah Epstein, Csanád I...