2968 search results - page 425 / 594 » Network Programming Using PLAN |
149
click to vote
CORR
2011
Springer
14 years 12 months ago
2011
Springer
Complex networks have been characterised by their specific connectivity patterns (network motifs), but their building blocks can also be identified and described by node-motifs—...
139
Voted
ICALP
2005
Springer
15 years 10 months ago
2005
Springer
Virtual Private Network Design is the following NP-hard problem. We are given a communication network, represented as a weighted graph with thresholds on the nodes which represent...
118
click to vote
CCS
2003
ACM
15 years 10 months ago
2003
ACM
To achieve security in wireless sensor networks, it is important to be able to encrypt and authenticate messages sent among sensor nodes. Keys for encryption and authentication pu...
152
click to vote
CP
2007
Springer
15 years 11 months ago
2007
Springer
Searching for optimal solutions to a problem using lower bounds obtained from a relaxation is a common idea in Heuristic Search and Planning. In SAT and CSPs, however, explicit rel...
154
click to vote
GLOBECOM
2010
IEEE
15 years 2 months ago
2010
IEEE
Nowadays, the Quality of Service (QoS) in Optical Grids has become a key issue. An important QoS factor is the resiliency, namely the ability to survive from certain network failur...