Sciweavers

1812 search results - page 263 / 363
» Test Early, Test Often
Sort
View
COMPGEOM
1998
ACM
15 years 2 months ago
Viewspace Partitioning of Densely Occluded Scenes
Computing the visibility of out-door scenes is often much harder than of in-door scenes. A typical urban scene, for example, is densely occluded, and it is effective to precompute...
Yiorgos Chrysanthou, Daniel Cohen-Or, Eyal Zadicar...
DFT
1997
IEEE
93views VLSI» more  DFT 1997»
15 years 2 months ago
An IDDQ Sensor for Concurrent Timing Error Detection
Abstract— Error control is a major concern in many computer systems, particularly those deployed in critical applications. Experience shows that most malfunctions during system o...
Christopher G. Knight, Adit D. Singh, Victor P. Ne...
CP
1997
Springer
15 years 2 months ago
Distributed Partial Constraint Satisfaction Problem
Many problems in multi-agent systems can be described as distributed Constraint Satisfaction Problems (distributed CSPs), where the goal is to nd a set of assignments to variables ...
Katsutoshi Hirayama, Makoto Yokoo
ECML
1997
Springer
15 years 2 months ago
Constructing Intermediate Concepts by Decomposition of Real Functions
In learning from examples it is often useful to expand an attribute-vector representation by intermediate concepts. The usual advantage of such structuring of the learning problemi...
Janez Demsar, Blaz Zupan, Marko Bohanec, Ivan Brat...
FPGA
1997
ACM
145views FPGA» more  FPGA 1997»
15 years 2 months ago
Generation of Synthetic Sequential Benchmark Circuits
Programmable logic architectures increase in capacity before commercial circuits are designed for them, yielding a distinct problem for FPGA vendors: how to test and evaluate the ...
Michael D. Hutton, Jonathan Rose, Derek G. Corneil