Sciweavers

1182 search results - page 131 / 237
» Reducing the Overhead of Dynamic Analysis
Sort
View
LCN
2003
IEEE
14 years 4 months ago
Regional Gossip Routing for Wireless Ad Hoc Networks
Abstract—Many routing protocols have been proposed for wireless ad hoc networks, and most of them are based on some variants of flooding. Thus many routing messages are propagat...
Xiang-Yang Li, Kousha Moaveninejad, Ophir Frieder
DATE
1999
IEEE
147views Hardware» more  DATE 1999»
14 years 3 months ago
Efficient BIST Hardware Insertion with Low Test Application Time for Synthesized Data Paths
In this paper, new and efficient BIST methodology and BIST hardware insertion algorithms are presented for RTL data paths obtained from high level synthesis. The methodology is ba...
Nicola Nicolici, Bashir M. Al-Hashimi
POS
1998
Springer
14 years 3 months ago
Optimizing the Read and Write Barriers for Orthogonal Persistence
Persistent programming languages manage volatile memory as a cache for stable storage, imposing a read barrier on operations that access the cache, and a write barrier on updates ...
Antony L. Hosking, Nathaniel Nystrom, Quintin I. C...
CN
2006
78views more  CN 2006»
13 years 11 months ago
CNPGSDP: An efficient group-based service discovery protocol for MANETs
The ability to discover services is the major prerequisite for effective usability of MANETs. Group-based Service Discovery (GSD) protocol is a typical service discovery protocol ...
Zhen-guo Gao, Ling Wang, Mei Yang, Xiaozong Yang
ITIIS
2008
84views more  ITIIS 2008»
13 years 11 months ago
A Scalable Recovery Tree Construction Scheme Considering Spatial Locality of Packet Loss
Packet losses tend to occur during short error bursts separated by long periods of relatively error-free transmission. There is also a significant spatial correlation in loss amon...
Jinsuk Baek, Jehan-François Pâris