Sciweavers

1220 search results - page 58 / 244
» Minimal Interval Completions
Sort
View
NOMS
2010
IEEE
172views Communications» more  NOMS 2010»
13 years 7 months ago
WiMFlow: a distributed, self-adaptive architecture for flow monitoring in Wireless Mesh Networks
—We present WiMFlow, a dynamic and self-organized flow monitoring framework in Wireless Mesh Networks. The protocol allows for an autonomic organization of the probes, with the ...
Cristian Popi, Olivier Festor
IJCAI
1989
13 years 10 months ago
Managing Efficiently Temporal Relations Through Indexed Spanning Trees
We are interested here in the design of a very efficient Time-Map Manager, able to deal with a large knowledge-base of several thou­ sand time-tokens in demanding applications su...
Malik Ghallab, A. Mounir Alaoui
ICCAD
2009
IEEE
152views Hardware» more  ICCAD 2009»
13 years 7 months ago
Adaptive sampling for efficient failure probability analysis of SRAM cells
In this paper, an adaptive sampling method is proposed for the statistical SRAM cell analysis. The method is composed of two components. One part is the adaptive sampler that manip...
Javid Jaffari, Mohab Anis
TAPSOFT
1991
Springer
14 years 24 days ago
Comparative Semantics for a Real-Time Programming Language with Integration
An operational and a denotational semantic model are presented for a real-time programming language incorporating the concept of integration. This concept of integration, which ha...
Franck van Breugel
FCT
2007
Springer
13 years 11 months ago
On the Complexity of Kings
The diameter of an undirected graph is the minimal number d such that there is a path between any two vertices of the graph of length at most d. The radius of a graph is the minim...
Edith Hemaspaandra, Lane A. Hemaspaandra, Till Tan...