Sciweavers

1368 search results - page 72 / 274
» Avoiding Simplicity Is Complex
Sort
View
WAW
2009
Springer
138views Algorithms» more  WAW 2009»
14 years 4 months ago
Information Theoretic Comparison of Stochastic Graph Models: Some Experiments
The Modularity-Q measure of community structure is known to falsely ascribe community structure to random graphs, at least when it is naively applied. Although Q is motivated by a ...
Kevin J. Lang
GLOBECOM
2008
IEEE
14 years 4 months ago
WPR: A Proactive Routing Protocol Tailored to Wireless Mesh Networks
— This work proposes the Wireless-mesh-network Proactive Routing (WPR) protocol for wireless mesh networks. Unlike current routing protocols, such as the Optimized LinkState Rout...
Miguel Elias M. Campista, Luís Henrique Mac...
EUROPAR
2007
Springer
14 years 4 months ago
Content-Based Publish/Subscribe Using Distributed R-Trees
Publish/subscribe systems provide a useful paradigm for selective data dissemination and most of the complexity related to addressing and routing is encapsulated within the network...
Silvia Bianchi, Pascal Felber, Maria Gradinariu
EUROGP
2005
Springer
122views Optimization» more  EUROGP 2005»
14 years 3 months ago
Evolution of Robot Controller Using Cartesian Genetic Programming
Abstract. Cartesian Genetic Programming is a graph based representation that has many benefits over traditional tree based methods, including bloat free evolution and faster evolu...
Simon Harding, Julian F. Miller
HPCC
2005
Springer
14 years 3 months ago
Transactional Cluster Computing
A lot of sophisticated techniques and platforms have been proposed to build distributed object systems. Remote method invocation and explicit message passing on top of traditional...
Stefan Frenz, Michael Schöttner, Ralph Gö...