Sciweavers

2056 search results - page 90 / 412
» time 2000
Sort
View
GLVLSI
2000
IEEE
87views VLSI» more  GLVLSI 2000»
15 years 8 months ago
Speeding up symbolic model checking by accelerating dynamic variable reordering
Symbolic Model checking is a widely used technique in sequential verification. As the size of the OBDDs and also the computation time depends on the order of the input variables,...
Christoph Meinel, Christian Stangier
MM
2000
ACM
100views Multimedia» more  MM 2000»
15 years 8 months ago
Stochastic resource prediction and admission for interactive sessions on multimedia servers
In highly interactive multimedia applications startup latency is significant, and may negatively impact performance and Quality of Service (QoS). To avoid this, our approach is t...
Matthias Friedrich, Silvia Hollfelder, Karl Aberer
RSCTC
2000
Springer
151views Fuzzy Logic» more  RSCTC 2000»
15 years 7 months ago
Anytime Algorithm for Feature Selection
Feature selection is used to improve performance of learning algorithms by finding a minimal subset of relevant features. Since the process of feature selection is computationally ...
Mark Last, Abraham Kandel, Oded Maimon, Eugene Ebe...
STACS
2000
Springer
15 years 7 months ago
The Stability of Saturated Linear Dynamical Systems Is Undecidable
We prove that several global properties (global convergence, global asymptotic stability, mortality, and nilpotence) of particular classes of discrete time dynamical systems are un...
Vincent D. Blondel, Olivier Bournez, Pascal Koiran...
ISAAC
2000
Springer
135views Algorithms» more  ISAAC 2000»
15 years 7 months ago
On Approximating Minimum Vertex Cover for Graphs with Perfect Matching
It has been a challenging open problem whether there is a polynomial time approximation algorithm for the Vertex Cover problem whose approximation ratio is bounded by a constant l...
Jianer Chen, Iyad A. Kanj