Sciweavers

340 search results - page 60 / 68
» Validating Business Requirements Using MAS Analysis Models
Sort
View
115
Voted
PEWASUN
2007
ACM
15 years 1 months ago
Worst-case lifetime computation of a wireless sensor network by model-checking
Wireless Sensor Network (WSN) technology is now mature enough to be used in numerous application domains. However, due to the restricted amount of energy usually allocated to each...
Laurent Mounier, Ludovic Samper, Wassim Znaidi
112
Voted
ASIACRYPT
2009
Springer
15 years 7 months ago
Security Notions and Generic Constructions for Client Puzzles
Computational puzzles are mildly difficult computational problems that require resources (processor cycles, memory, or both) to solve. Puzzles have found a variety of uses in secu...
Liqun Chen, Paul Morrissey, Nigel P. Smart, Bogdan...
87
Voted
SIGSOFT
2005
ACM
16 years 1 months ago
Lightweight object specification with typestates
Previous work has proven typestates to be useful for modeling protocols in object-oriented languages. We build on this work by addressing substitutability of subtypes as well as i...
Kevin Bierhoff, Jonathan Aldrich
117
Voted
NDSS
2009
IEEE
15 years 7 months ago
RAINBOW: A Robust And Invisible Non-Blind Watermark for Network Flows
Linking network flows is an important problem in intrusion detection as well as anonymity. Passive traffic analysis can link flows but requires long periods of observation to r...
Amir Houmansadr, Negar Kiyavash, Nikita Borisov
101
Voted
BMCBI
2005
158views more  BMCBI 2005»
15 years 9 days ago
Automated generation of heuristics for biological sequence comparison
Background: Exhaustive methods of sequence alignment are accurate but slow, whereas heuristic approaches run quickly, but their complexity makes them more difficult to implement. ...
Guy St. C. Slater, Ewan Birney