818 search results - page 11 / 164 » Network bargaining: algorithms and structural results |
JDCTA
2010
13 years 2 months ago
2010
A novel breadth-first based structural clustering method for graphs is proposed. Clustering is an important task for analyzing complex networks such as biological networks, World ...
MOBIHOC
2004
ACM
14 years 7 months ago
2004
ACM
We propose several novel localized algorithms to construct energy efficient routing structures for homogeneous wireless ad hoc networks, where all nodes have same maximum transmis...
IJAR
2010
13 years 6 months ago
2010
We recall the basic idea of an algebraic approach to learning Bayesian network (BN) structures, namely to represent every BN structure by a certain (uniquely determined) vector, c...
MOBICOM
2004
ACM
14 years 1 months ago
2004
ACM
Realistic models for node movement are essential in simulating mobile ad hoc networks. Many MANET scenarios are most realistically represented using group movement, but existing g...
ECAI
2008
Springer
13 years 9 months ago
2008
Springer
Many real-world applications of AI require both probability and first-order logic to deal with uncertainty and structural complexity. Logical AI has focused mainly on handling com...