Sciweavers

1182 search results - page 177 / 237
» Reducing the Overhead of Dynamic Analysis
Sort
View
CN
2008
192views more  CN 2008»
13 years 9 months ago
Research on multicast routing protocols for mobile ad-hoc networks
A mobile ad-hoc network (MANET) is composed of mobile nodes without any infrastructure. Mobile nodes self-organize to form a network over radio links. The goal of MANETs is to ext...
Junhai Luo, Xue Liu, Danxia Ye
CN
2006
91views more  CN 2006»
13 years 9 months ago
Reputation-based policies that provide the right incentives in peer-to-peer environments
Peer-to-peer are popular environments for exchanging services. A reputation mechanism is a proper means of discovering low-performing peers that fail to provide their services. In...
Thanasis G. Papaioannou, George D. Stamoulis
ISCA
2006
IEEE
144views Hardware» more  ISCA 2006»
13 years 8 months ago
Conditional Memory Ordering
Conventional relaxed memory ordering techniques follow a proactive model: at a synchronization point, a processor makes its own updates to memory available to other processors by ...
Christoph von Praun, Harold W. Cain, Jong-Deok Cho...
COMCOM
2004
153views more  COMCOM 2004»
13 years 8 months ago
BLR: beacon-less routing algorithm for mobile ad hoc networks
Routing of packets in mobile ad hoc networks with a large number of nodes or with high mobility is a very difficult task and current routing protocols do not really scale well wit...
Marc Heissenbüttel, Torsten Braun, Thomas Ber...
DCOSS
2011
Springer
12 years 8 months ago
A local average consensus algorithm for wireless sensor networks
—In many application scenarios sensors need to calculate the average of some local values, e.g. of local measurements. A possible solution is to rely on consensus algorithms. In ...
Konstantin Avrachenkov, Mahmoud El Chamie, Giovann...