3820 search results - page 455 / 764 » Bounded Model Debugging |
142
click to vote
ALGORITHMICA
2005
15 years 3 months ago
2005
An optimal prefetching and I/O scheduling algorithm L-OPT, for parallel I/O systems, using a read-once model of block references is presented. The algorithm uses knowledge of the n...
118
click to vote
TIT
2008
15 years 3 months ago
2008
Abstract--This letter considers the average complexity of maximum-likelihood (ML) decoding of convolutional codes. ML decoding can be modeled as finding the most probable path take...
132
click to vote
TOG
2008
15 years 3 months ago
2008
We present a novel shadow map parameterization to reduce perspective aliasing artifacts for both point and directional light sources. We derive the aliasing error equations for bo...
118
click to vote
TOG
2008
15 years 3 months ago
2008
We introduce a volumetric space-time technique for the reconstruction of moving and deforming objects from point data. The output of our method is a four-dimensional space-time so...
131
click to vote
TOPNOC
2008
15 years 3 months ago
2008
Abstract. In a seminal paper, McMillan proposed a technique for constructing a finite complete prefix of the unfolding of bounded (i.e., finitestate) Petri nets, which can be used ...