Sciweavers

5580 search results - page 767 / 1116
» Randomized priority algorithms
Sort
View
LCN
2006
IEEE
16 years 24 days ago
Content-based Packet Marking for Application-Aware Processing in Overlay Networks
: In many emerging sensing applications, random network losses may lead to drop of critical information, rendering partially received data useless for the end users. A packet-marki...
Panho Lee, Tarun Banka, Anura P. Jayasumana, V. Ch...
ACIVS
2006
Springer
16 years 23 days ago
Adaptive Vision Leveraging Digital Retinas: Extracting Meaningful Segments
In general, the less probable an event, the more attention we pay to it. Likewise, considering visual perception, it is interesting to regard important image features as those that...
Nicolas Burrus, Thierry M. Bernard
CEC
2005
IEEE
16 years 12 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,...
NCA
2005
IEEE
16 years 11 days ago
Cooperative Mobile Agents to Gather Global Information
Abstract— This paper describes an original approach to writing reactive algorithms on highly dynamic networks. We propose to use randomly mobile agents to gather global informati...
Michel Charpentier, Gérard Padiou, Philippe...
ADHOCNOW
2005
Springer
16 years 10 days ago
Cache Placement in Sensor Networks Under Update Cost Constraint
— In this paper, we address an optimization problem that arises in context of cache placement in sensor networks. In particular, we consider the cache placement problem where the...
Bin Tang, Samir R. Das, Himanshu Gupta