Sciweavers

2877 search results - page 420 / 576
» The Complexity of Planarity Testing
Sort
View
119
Voted
VTS
1997
IEEE
73views Hardware» more  VTS 1997»
15 years 8 months ago
Obtaining High Fault Coverage with Circular BIST Via State Skipping
Despite all of the advantages that circular BIST ofsers compared to conventional BIST approaches in terms of low area overhead, simple control logic, and easy insertion, it has se...
Nur A. Touba
146
Voted
ECML
1997
Springer
15 years 8 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...
130
Voted
ICLP
1997
Springer
15 years 8 months ago
Non-Failure Analysis for Logic Programs
We provide a method whereby, given mode and (upper approximation) type information, we can detect procedures and goals that can be guaranteed to not fail (i.e., to produce at leas...
Saumya K. Debray, Pedro López-García...
186
Voted
CPE
1994
Springer
170views Hardware» more  CPE 1994»
15 years 8 months ago
Automatic Scalability Analysis of Parallel Programs Based on Modeling Techniques
When implementingparallel programs forparallel computer systems the performancescalability of these programs should be tested and analyzed on different computer configurations and...
Allen D. Malony, Vassilis Mertsiotakis, Andreas Qu...
KGC
1993
Springer
15 years 8 months ago
Nonmonotonic Reasoning is Sometimes Simpler
We establish the complexity of decision problems associated with the nonmonotonic modal logic S4. We prove that the problem of existence of an S4-expansion for a given set A of pr...
Grigori Schwarz, Miroslaw Truszczynski