523 search results - page 62 / 105 » On the Signal Bounding Problem in Timing Analysis |
ETT
2002
13 years 7 months ago
2002
In computer networks, the Strict Priority (SP) discipline is perhaps the most common and simplest method to schedule packets from different classes of applications, each with diver...
MOBIHOC
2007
ACM
14 years 7 months ago
2007
ACM
Several centralized and distributed algorithms have been recently proposed to maximize the multicast lifetime for directional communications in wireless ad-hoc networks. Their per...
ALT
2007
Springer
14 years 4 months ago
2007
Springer
Algorithms based on upper-confidence bounds for balancing exploration and exploitation are gaining popularity since they are easy to implement, efficient and effective. In this p...
CHES
2006
Springer
13 years 11 months ago
2006
Springer
In recent years, some countermeasures against Differential Power Analysis (DPA) at the logic level have been proposed. At CHES 2005 conference, Popp and Mangard proposed a new coun...
ICAPR
2005
Springer
14 years 1 months ago
2005
Springer
Contrary to popular belief, despite decades of research in fingerprints, reliable fingerprint recognition is an open problem. Extracting features out of poor quality prints is t...