Sciweavers

1469 search results - page 94 / 294
» Characterizing the Structural Complexity of Real-World Compl...
Sort
View
DAM
2011
15 years 1 months ago
A General Label Search to investigate classical graph search algorithms
Many graph search algorithms use a labeling of the vertices to compute an ordering of the vertices. We generalize this idea by devising a general vertex labeling algorithmic proce...
Richard Krueger, Geneviève Simonet, Anne Be...
GPEM
2007
95views more  GPEM 2007»
15 years 6 months ago
Where is evolutionary computation going? A temporal analysis of the EC community
Studying an evolving complex system and drawing some conclusions from it is an integral part of nature-inspired computing; being a part of that complex system, some insight can als...
Carlos Cotta, Juan Julián Merelo Guerv&oacu...
CDC
2008
IEEE
102views Control Systems» more  CDC 2008»
16 years 20 days ago
Conservation laws and open systems on higher-dimensional networks
— We discuss a framework for defining physical open systems on higher-dimensional complexes. We start with the formalization of the dynamics of open electrical circuits and the ...
Arjan van der Schaft, Bernhard Maschke
ICNP
2006
IEEE
16 years 7 days ago
Orthogonal Rendezvous Routing Protocol for Wireless Mesh Networks
— Routing in multi-hop wireless networks involves the indirection from a persistent name (or ID) to a locator. Concepts such as coordinate space embedding help reduce the number ...
Bow-Nan Cheng, Murat Yuksel, Shivkumar Kalyanarama...
AI
2010
Springer
15 years 6 months ago
Understanding the scalability of Bayesian network inference using clique tree growth curves
Bayesian networks (BNs) are used to represent and ef ciently compute with multi-variate probability distributions in a wide range of disciplines. One of the main approaches to per...
Ole J. Mengshoel