Sciweavers

2994 search results - page 245 / 599
» Time sequences
Sort
View
CPAIOR
2010
Springer
15 years 9 months ago
The Increasing Nvalue Constraint
This paper introduces the Increasing Nvalue constraint, which restricts the number of distinct values assigned to a sequence of variables so that each variable in the sequence is l...
Nicolas Beldiceanu, Fabien Hermenier, Xavier Lorca...
DATE
1999
IEEE
120views Hardware» more  DATE 1999»
15 years 9 months ago
FreezeFrame: Compact Test Generation Using a Frozen Clock Strategy
Test application time is an important factor in the overall cost of VLSI chip testing. We present a new ATPG approach for generating compact test sequences for sequential circuits...
Yanti Santoso, Matthew C. Merten, Elizabeth M. Rud...
GECCO
2006
Springer
282views Optimization» more  GECCO 2006»
15 years 8 months ago
A genetic algorithm for the longest common subsequence problem
A genetic algorithm for the longest common subsequence problem encodes candidate sequences as binary strings that indicate subsequences of the shortest or first string. Its fitnes...
Brenda Hinkemeyer, Bryant A. Julstrom
180
Voted
FMN
2010
Springer
179views Multimedia» more  FMN 2010»
15 years 6 months ago
QoE as a Function of Frame Rate and Resolution Changes
Video bit rate reduction can be very important for all video streaming application. One of the possible ways to reduce bit rate is decreasing change in time or space domain i.e. ch...
Lucjan Janowski, Piotr Romaniak
IICAI
2007
15 years 6 months ago
Modeling Temporal Behavior via Structured Hidden Markov Models: an Application to Keystroking Dynamics
Structured Hidden Markov Models (S-HMM) are a variant of Hierarchical Hidden Markov Models; it provides an abstraction mechanism allowing a high level symbolic description of the k...
Ugo Galassi, Attilio Giordana, Charbel Julien, Lor...