Sciweavers

2056 search results - page 30 / 412
» time 2000
Sort
View
ECCC
2000
77views more  ECCC 2000»
13 years 10 months ago
Polynomial-Time Recognition of Minimal Unsatisfiable Formulas with Fixed Clause-Variable Difference
A formula (in conjunctive normal form) is said to be minimal unsatisfiable if it is unsatisfiable and deleting any clause makes it satisfiable. The deficiency of a formula is the ...
Herbert Fleischner, Stefan Szeider
JCT
2000
103views more  JCT 2000»
13 years 10 months ago
A Combinatorial Algorithm Minimizing Submodular Functions in Strongly Polynomial Time
We give a strongly polynomial-time algorithm minimizing a submodular function f given by a value-giving oracle. The algorithm does not use the ellipsoid method or any other linear ...
Alexander Schrijver
RTS
2000
82views more  RTS 2000»
13 years 10 months ago
Priority Scheduling Versus Pre-Run-Time Scheduling
Builders of real-time systems often use priority scheduling in their systems without considering alternatives. This paper examines one alternative, pre-run-time scheduling, and sho...
Jia Xu, David Lorge Parnas
DATE
2000
IEEE
113views Hardware» more  DATE 2000»
14 years 3 months ago
Static Timing Analysis of Embedded Software on Advanced Processor Architectures
This paper examines several techniques for static timing analysis. In detail, the first part of the paper analyzes the connection of prediction accuracy (worst case execution tim...
André Hergenhan, Wolfgang Rosenstiel
DATE
2000
IEEE
86views Hardware» more  DATE 2000»
14 years 3 months ago
Analysis and Minimization of Test Time in a Combined BIST and External Test Approach
In this paper, an analysis of test time by CBET (which is an acronym for Combination of BIST and External Test) test approach is presented. The analysis validates that CBET test a...
Makoto Sugihara, Hiroto Yasuura, Hiroshi Date