Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
76,354
Average waiting time analysis in Cognitive Radio With and Without Relaying Capability
"... This paper presents average waiting time analysis in Cognitive Radio with and without relaying capability. We perform theoretical analysis by applying M/D/1 queuing scheme in order to find the waiting time in queue. Result indicates that the benefits of relaying for primary link depends on the data ..."
Abstract
- Add to MetaCart
This paper presents average waiting time analysis in Cognitive Radio with and without relaying capability. We perform theoretical analysis by applying M/D/1 queuing scheme in order to find the waiting time in queue. Result indicates that the benefits of relaying for primary link depends on the data
A Statistical Analysis of the Average Waiting Time Between Flares in Lupus Patients
, 2004
"... In this study I investigate the effect of race and type of lupus on the manifestation of the disease, specifically through the average number of days between recurrences of flares due to the disease. Lupus is an auto-immune disease that doctors and researchers do not completely understand. The most ..."
Abstract
- Add to MetaCart
University. In this manuscript I explore the underlying distributions for the waiting times between flares for each of the groups I am comparing: African-Americans versus Caucasians, and renal versus non-renal lupus patients. Because of the large number of censored datapoints, survival analysis is the most
Computing the Signal Duration to Minimize Average Waiting Time using Round Robin Algorithm
"... Abstract: Real Time Traffic Signal Control System using CCTV cameras adjust dynamically the signal timings of the intersection points in response to variation in traffic load and system capacity. Round Robin Scheduling Algorithm has been suggested for computing the green signal time to release the c ..."
Abstract
- Add to MetaCart
the computed traffic load with minimum average waiting time. This time can be used to logically regulate the traffic flow on the roads. Relationship has been analysed between minimum average waiting time and the quantum time allotted to each side of the intersection point to release the traffic load.
An Improved Round Robin Approach using Dynamic Time Quantum for Improving Average Waiting Time
"... Round Robin scheduling algorithm is the most often used scheduling algorithm in timesharing systems as it is fair to all processes and is starvation free. But along with these advantages it suffers from some drawbacks such as more number of context switches, long waiting and long turnaround time. Th ..."
Abstract
- Add to MetaCart
of round robin algorithm performs better than the conventional round robin algorithm in terms various performance metrics such as number of context switches, average waiting and turnaround time.
Spray and Wait: An Efficient Routing Scheme for Intermittently Connected Mobile Networks
, 2001
"... Intermittently connected mobile networks are sparse wireless networks where most of the time there does not exist a complete path from the source to the destination. These networks ..."
Abstract
-
Cited by 503 (10 self)
- Add to MetaCart
Intermittently connected mobile networks are sparse wireless networks where most of the time there does not exist a complete path from the source to the destination. These networks
Illiquidity and stock returns: cross-section and time-series effects,
- Journal of Financial Markets
, 2002
"... Abstract This paper shows that over time, expected market illiquidity positively affects ex ante stock excess return, suggesting that expected stock excess return partly represents an illiquidity premium. This complements the cross-sectional positive return-illiquidity relationship. Also, stock ret ..."
Abstract
-
Cited by 864 (9 self)
- Add to MetaCart
returns are negatively related over time to contemporaneous unexpected illiquidity. The illiquidity measure here is the average across stocks of the daily ratio of absolute stock return to dollar volume, which is easily obtained from daily stock data for long time series in most stock markets. Illiquidity
Consensus Problems in Networks of Agents with Switching Topology and Time-Delays
, 2003
"... In this paper, we discuss consensus problems for a network of dynamic agents with fixed and switching topologies. We analyze three cases: i) networks with switching topology and no time-delays, ii) networks with fixed topology and communication time-delays, and iii) max-consensus problems (or leader ..."
Abstract
-
Cited by 1112 (21 self)
- Add to MetaCart
In this paper, we discuss consensus problems for a network of dynamic agents with fixed and switching topologies. We analyze three cases: i) networks with switching topology and no time-delays, ii) networks with fixed topology and communication time-delays, and iii) max-consensus problems (or
Distributed space-time-coded protocols for exploiting cooperative diversity in wireless networks
- IEEE TRANS. INF. THEORY
, 2003
"... We develop and analyze space–time coded cooperative diversity protocols for combating multipath fading across multiple protocol layers in a wireless network. The protocols exploit spatial diversity available among a collection of distributed terminals that relay messages for one another in such a m ..."
Abstract
-
Cited by 622 (5 self)
- Add to MetaCart
We develop and analyze space–time coded cooperative diversity protocols for combating multipath fading across multiple protocol layers in a wireless network. The protocols exploit spatial diversity available among a collection of distributed terminals that relay messages for one another in such a
Graphs over Time: Densification Laws, Shrinking Diameters and Possible Explanations
, 2005
"... How do real graphs evolve over time? What are “normal” growth patterns in social, technological, and information networks? Many studies have discovered patterns in static graphs, identifying properties in a single snapshot of a large network, or in a very small number of snapshots; these include hea ..."
Abstract
-
Cited by 541 (48 self)
- Add to MetaCart
, and we observe some surprising phenomena. First, most of these graphs densify over time, with the number of edges growing superlinearly in the number of nodes. Second, the average distance between nodes often shrinks over time, in contrast to the conventional wisdom that such distance parameters should
Algorithms for Scalable Synchronization on Shared-Memory Multiprocessors
- ACM Transactions on Computer Systems
, 1991
"... Busy-wait techniques are heavily used for mutual exclusion and barrier synchronization in shared-memory parallel programs. Unfortunately, typical implementations of busy-waiting tend to produce large amounts of memory and interconnect contention, introducing performance bottlenecks that become marke ..."
Abstract
-
Cited by 573 (32 self)
- Add to MetaCart
Busy-wait techniques are heavily used for mutual exclusion and barrier synchronization in shared-memory parallel programs. Unfortunately, typical implementations of busy-waiting tend to produce large amounts of memory and interconnect contention, introducing performance bottlenecks that become
Results 1 - 10
of
76,354
