Sciweavers

798 search results - page 152 / 160
» Proving More Properties with Bounded Model Checking
Sort
View
SP
2010
IEEE
156views Security Privacy» more  SP 2010»
14 years 9 months ago
Round-Efficient Broadcast Authentication Protocols for Fixed Topology Classes
Abstract--We consider resource-constrained broadcast authentication for n receivers in a static, known network topology. There are only two known broadcast authentication protocols...
Haowen Chan, Adrian Perrig
INFOCOM
2006
IEEE
15 years 5 months ago
The Complexity of Connectivity in Wireless Networks
— We define and study the scheduling complexity in wireless networks, which expresses the theoretically achievable efficiency of MAC layer protocols. Given a set of communicati...
Thomas Moscibroda, Roger Wattenhofer
GECCO
2007
Springer
181views Optimization» more  GECCO 2007»
15 years 5 months ago
ACOhg: dealing with huge graphs
Ant Colony Optimization (ACO) has been successfully applied to those combinatorial optimization problems which can be translated into a graph exploration. Artificial ants build s...
Enrique Alba, J. Francisco Chicano
115
Voted
INFOCOM
2010
IEEE
14 years 9 months ago
On Space-Time Capacity Limits in Mobile and Delay Tolerant Networks
We investigate the fundamental capacity limits of space-time journeys of information in mobile and Delay Tolerant Networks (DTNs), where information is either transmitted or carrie...
Philippe Jacquet, Bernard Mans, Georgios Rodolakis
LICS
2000
IEEE
15 years 4 months ago
Concurrent Omega-Regular Games
We consider two-player games which are played on a finite state space for an infinite number of rounds. The games are concurrent, that is, in each round, the two players choose ...
Luca de Alfaro, Thomas A. Henzinger