Sciweavers

332 search results - page 12 / 67
» Compositions of Graphs Revisited
Sort
View
SASN
2004
ACM
14 years 24 days ago
Revisiting random key pre-distribution schemes for wireless sensor networks
Key management is one of the fundamental building blocks of security services. In a network with resource constrained nodes like sensor networks, traditional key management techni...
Joengmin Hwang, Yongdae Kim
INFOCOM
2005
IEEE
14 years 29 days ago
Link scheduling in sensor networks: distributed edge coloring revisited
— We consider the problem of link scheduling in a sensor network employing a TDMA MAC protocol. Our link scheduling algorithm involves two phases. In the first phase, we assign ...
Shashidhar Gandham, Milind Dawande, Ravi Prakash
ECAI
2008
Springer
13 years 9 months ago
Heuristics for Planning with Action Costs Revisited
We introduce a simple variation of the additive heuristic used in the HSP planner that combines the benefits of the original additive heuristic, namely its mathematical formulation...
Emil Keyder, Hector Geffner
FM
2009
Springer
134views Formal Methods» more  FM 2009»
13 years 5 months ago
Partial Order Reductions Using Compositional Confluence Detection
Abstract. Explicit state methods have proven useful in verifying safetycritical systems containing concurrent processes that run asynchronously and communicate. Such methods consis...
Frédéric Lang, Radu Mateescu
DAC
2000
ACM
14 years 8 months ago
Analysis of composition complexity and how to obtain smaller canonical graphs
Jawahar Jain, K. Mohanram, Dinos Moundanos, Ingo W...