Sciweavers

1026 search results - page 135 / 206
» On Finding Minimal w-cutset
Sort
View
ATAL
2003
Springer
14 years 3 months ago
Resource-aware exploration of the emergent dynamics of simulated systems
The emerging science of simulation enables us to explore the dynamics of large and complex systems even if a formal representation and analysis of the system is intractable and a ...
Sven Brueckner, H. Van Dyke Parunak
IEEEINTERACT
2002
IEEE
14 years 3 months ago
Code Cache Management Schemes for Dynamic Optimizers
A dynamic optimizer is a software-based system that performs code modifications at runtime, and several such systems have been proposed over the past several years. These systems ...
Kim M. Hazelwood, Michael D. Smith
SSD
2001
Springer
218views Database» more  SSD 2001»
14 years 2 months ago
Efficient Mining of Spatiotemporal Patterns
The problem of mining spatiotemporal patterns is finding sequences of events that occur frequently in spatiotemporal datasets. Spatiotemporal datasets store the evolution of object...
Ilias Tsoukatos, Dimitrios Gunopulos
CIAC
2000
Springer
210views Algorithms» more  CIAC 2000»
14 years 2 months ago
Computing a Diameter-Constrained Minimum Spanning Tree in Parallel
A minimum spanning tree (MST) with a small diameter is required in numerous practical situations. It is needed, for example, in distributed mutual exclusion algorithms in order to ...
Narsingh Deo, Ayman Abdalla
ITC
1998
IEEE
61views Hardware» more  ITC 1998»
14 years 2 months ago
Test session oriented built-in self-testable data path synthesis
Existing high-level BIST synthesis methods focus on one objective, minimizing either area overhead or test time. Hence, those methods do not render exploration of large design spa...
Han Bin Kim, Takeshi Takahashi, Dong Sam Ha