7311 search results - page 123 / 1463 » Time in State Machines |
141
click to vote
SOFSEM
2007
Springer
15 years 10 months ago
2007
Springer
Digital technology is increasingly deployed in safety-critical situations. This calls for systematic design and verification methodologies that can cope with three major sources o...
108
click to vote
EOR
2006
15 years 4 months ago
2006
The Shifting Bottleneck (SB) heuristic is among the most successful approximation methods for solving the Job Shop problem. It is essentially a machine based decomposition procedu...
136
click to vote
JCO
2002
15 years 3 months ago
2002
The single machine scheduling problem with sum of completion times criterion (SS) can be solved easily by the Shortest Processing Time (SPT) rule. In the case of significant uncert...
159
click to vote
TALG
2008
15 years 4 months ago
2008
Abstract. We present a new analysis of the well-known family of multiplicative hash functions, and improved deterministic algorithms for selecting "good" hash functions. ...
137
click to vote
ICMCS
2005
IEEE
15 years 10 months ago
2005
IEEE
In this paper, we present a novel reversible watermarking scheme for image authentication for JPEG/JPEG-2000 coded images. Since the watermarking scheme is reversible, the exact o...