Sciweavers

2778 search results - page 130 / 556
» Limit complexities revisited
Sort
View
IEEEARES
2008
IEEE
15 years 11 months ago
Improving Techniques for Proving Undecidability of Checking Cryptographic Protocols
Existing undecidability proofs of checking secrecy of cryptographic protocols have the limitations of not considering protocols common in literature, which are in the form of comm...
Zhiyao Liang, Rakesh M. Verma
149
Voted
WETICE
2007
IEEE
15 years 11 months ago
A Dominating Set Based Peer-to-Peer Protocol for Real-Time Multi-source Collaboration
Designing a collaborative architecture for real-time applications is an intricate challenge that usually involves dealing with the real-time constraints, resource limitations and ...
Dewan Tanvir Ahmed, Shervin Shirmohammadi, Abdulmo...
PADS
2005
ACM
15 years 10 months ago
Distributed Worm Simulation with a Realistic Internet Model
Internet worm spread is a phenomenon involving millions of hosts, who interact in complex and diverse environment. Scanning speed of each infected host depends on its resources an...
Songjie Wei, Jelena Mirkovic, D. Martin Swany
IPSN
2005
Springer
15 years 10 months ago
Beyond event handlers: programming wireless sensors with attributed state machines
— Event-driven programming is a popular paradigm for programming sensor nodes. It is based on the specification of actions (also known as event handlers) which are triggered by ...
Oliver Kasten, Kay Römer
IEAAIE
2001
Springer
15 years 9 months ago
A Mixed Closure-CSP Method to Solve Scheduling Problems
Scheduling problems can be seen as a set of temporal metric and disjunctive constraints. So, they can be formulated in terms of CSPs techniques. In the literature, there are CSP-b...
María Isabel Alfonso Galipienso, Federico B...