Sciweavers

296 search results - page 41 / 60
» Bipartite Graphs as Models of Complex Networks
Sort
View
GECCO
2007
Springer
168views Optimization» more  GECCO 2007»
15 years 6 months ago
Stability in the self-organized evolution of networks
The modeling and analysis of large networks of autonomous agents is an important topic with applications in many different disciplines. One way of modeling the development of such...
Thomas Jansen, Madeleine Theile
INFOCOM
2006
IEEE
15 years 5 months ago
Landmark-Based Information Storage and Retrieval in Sensor Networks
— For a wide variety of sensor network environments, location information is unavailable or expensive to obtain. We propose a location-free, lightweight, distributed, and data-ce...
Qing Fang, Jie Gao, Leonidas J. Guibas
ACSW
2006
15 years 1 months ago
Simulating a computational grid with networked animat agents
Computational grids are now widespread, but their large-scale behaviour is still poorly understood. We report on some calculations of loading, scaling and utilisation behaviours o...
Kenneth A. Hawick, Heath A. James
WG
1998
Springer
15 years 4 months ago
Graphs with Bounded Induced Distance
In this work we introduce the class of graphs with bounded induced distance of order k, (BID(k) for short). A graph G belongs to BID(k) if the distance between any two nodes in ev...
Serafino Cicerone, Gabriele Di Stefano
CP
2006
Springer
15 years 3 months ago
Compiling Constraint Networks into AND/OR Multi-valued Decision Diagrams (AOMDDs)
Abstract. Inspired by AND/OR search spaces for graphical models recently introduced, we propose to augment Ordered Decision Diagrams with AND nodes, in order to capture function de...
Robert Mateescu, Rina Dechter