4009 search results - page 505 / 802 » Clustering on Complex Graphs |
225
click to vote
ATAL
2010
Springer
15 years 7 months ago
2010
Springer
We propose Path Disruption Games (PDGs), which consider collaboration between agents attempting stop an adversary from travelling from a source node to a target node in a graph. P...
203
click to vote
GECCO
2008
Springer
2008
Springer
Bond-graphs + genetic programming: analysis of an automatically synthesized rotary mechanical system
15 years 7 months ago
Initial results of an experiment devised to combine Bond-Graph modeling and simulation with genetic programming for automated design of a simple mechatronic system are reported in...
185
click to vote
TNN
2010
15 years 1 months ago
2010
In this paper we provide theoretical and numerical analysis of a geometric activity flow network model which is aimed at explaining mathematically the scale-free functional graph s...
185
click to vote
ICDM
2006
IEEE
16 years 22 days ago
2006
IEEE
Kernel methods have been shown to be very effective for applications requiring the modeling of structured objects. However kernels for structures usually are too computational dem...
184
click to vote
ISCIS
2005
Springer
16 years 5 days ago
2005
Springer
Dense subgraphs of sparse graphs (communities), which appear in most real-world complex networks, play an important role in many contexts. Computing them however is generally expe...