145 search results - page 25 / 29 » The use of random simulation in formal verification |
JNW
2006
13 years 7 months ago
2006
In ad hoc wireless LANs populated by mutually impenetrable groups of anonymous stations, honest stations are prone to "bandwidth stealing" by selfish stations. The proble...
FMICS
2009
Springer
14 years 2 months ago
2009
Springer
on Abstraction: a Lightweight Approach to Modelling Concurrency. Javier de Dios and Ricardo Peña Certified Implementation on top of the Java Virtual Machine 19:00 Social dinner + ...
JAIR
2007
13 years 7 months ago
2007
Most classical scheduling formulations assume a fixed and known duration for each activity. In this paper, we weaken this assumption, requiring instead that each duration can be ...
ASUNAM
2010
IEEE
13 years 9 months ago
2010
IEEE
Abstract--We present a novel and efficient algorithm, PATH COVERING, for solving the most reliable subgraph problem. A reliable subgraph gives a concise summary of the connectivity...
IJWIN
2006
13 years 7 months ago
2006
Abstract-- We consider a wireless sensor network consisting of a set of sensors deployed randomly. A point in the monitored area is covered if it is within the sensing range of a s...