Sciweavers

3991 search results - page 708 / 799
» Bounding homogeneous models
Sort
View
CPC
1998
91views more  CPC 1998»
13 years 7 months ago
Complexity and Probability of Some Boolean Formulas
For any Boolean functionf letL(f) be its formulasizecomplexityin the basis f^ 1g. For every n and every k n=2, we describe a probabilistic distribution on formulas in the basis f^...
Petr Savický
DAM
1998
77views more  DAM 1998»
13 years 7 months ago
The Scheduling of Maintenance Service
We study a discrete problem of scheduling activities of several types under the constraint that at most a single activity can be scheduled to any one period. Applications of such ...
Shoshana Anily, Celia A. Glass, Refael Hassin
TC
1998
13 years 7 months ago
Optimal Zero-Aliasing Space Compaction of Test Responses
—Many built-in self-testing (BIST) schemes compress the test responses from a k-output circuit to q signature streams, where q << k, a process termed space compaction. The ...
Krishnendu Chakrabarty, Brian T. Murray, John P. H...
SIAMDM
2002
124views more  SIAMDM 2002»
13 years 7 months ago
Scheduling Unrelated Machines by Randomized Rounding
We present a new class of randomized approximation algorithms for unrelated parallel machine scheduling problems with the average weighted completion time objective. The key idea i...
Andreas S. Schulz, Martin Skutella
SIAMJO
2002
122views more  SIAMJO 2002»
13 years 7 months ago
Robust Filtering via Semidefinite Programming with Applications to Target Tracking
In this paper we propose a novel finite-horizon, discrete-time, time-varying filtering method based on the robust semidefinite programming (SDP) technique. The proposed method prov...
Lingjie Li, Zhi-Quan Luo, Timothy N. Davidson, Kon...