Sciweavers

2434 search results - page 239 / 487
» Algorithmic Randomness of Closed Sets
Sort
View
INFOCOM
2003
IEEE
15 years 11 months ago
Robust Monitoring of Link Delays and Faults in IP Networks
Abstract – In this paper, we develop failure-resilient techniques for monitoring link delays and faults in a Service Provider or Enterprise IP network. Our two-phased approach at...
Yigal Bejerano, Rajeev Rastogi
CORR
2010
Springer
107views Education» more  CORR 2010»
15 years 5 months ago
Maximum Betweenness Centrality: Approximability and Tractable Cases
The Maximum Betweenness Centrality problem (MBC) can be defined as follows. Given a graph find a k-element node set C that maximizes the probability of detecting communication be...
Martin Fink, Joachim Spoerhase
PARLE
1991
15 years 10 months ago
FORK: A High-Level Language for PRAMs
We present a new programming language designed to allow the convenient expression of algorithms for a parallel random access machine (PRAM). The language attempts to satisfy two p...
Torben Hagerup, Arno Schmitt, Helmut Seidl
CEC
2005
IEEE
16 years 3 days ago
Dynamic power minimization during combinational circuit testing as a traveling salesman problem
Testing of VLSI circuits can cause generation of excessive heat which can damage the chips under test. In the random testing environment, high-performance CMOS circuits consume sig...
Artem Sokolov, Alodeep Sanyal, L. Darrell Whitley,...
RTCSA
1999
IEEE
15 years 10 months ago
Non-Blocking Data Sharing in Multiprocessor Real-Time Systems
A non-blocking protocol that allows real-time tasks to share data in a multiprocessor system is presented in this paper. The protocol gives the means to concurrent real-time tasks...
Philippas Tsigas, Yi Zhang