Sciweavers

2270 search results - page 227 / 454
» On the distribution of eigenvalues of graphs
Sort
View
ICRA
2008
IEEE
147views Robotics» more  ICRA 2008»
16 years 1 months ago
Automatic deployment and formation control of decentralized multi-agent networks
— Novel tools are needed to deploy multi-agent networks in applications that require a high degree of accuracy in the achievement and maintenance of geometric formations. This is...
Brian Stephen Smith, Magnus Egerstedt, Ayanna M. H...
CONCUR
2004
Springer
15 years 12 months ago
Model Checking Restricted Sets of Timed Paths
In this paper, we study the complexity of model-checking formulas of three important real-time logics (MTL, MITL, and TCTL) over restricted sets of timed paths. The classes of rest...
Nicolas Markey, Jean-François Raskin
NIPS
2003
15 years 8 months ago
Linear Response for Approximate Inference
Belief propagation on cyclic graphs is an efficient algorithm for computing approximate marginal probability distributions over single nodes and neighboring nodes in the graph. I...
Max Welling, Yee Whye Teh
CPHYSICS
2007
91views more  CPHYSICS 2007»
15 years 6 months ago
Characteristics of networks in financial markets
We investigate the financial network of the Korea Stock Exchange (KSE) using numerical simulations and scaling arguments. The frequency of degree and the edge density for a real ...
Kyungsik Kim, Soo Yong Kim, Deock-Ho Ha
COMBINATORICS
2000
112views more  COMBINATORICS 2000»
15 years 6 months ago
A Note on Random Minimum Length Spanning Trees
Consider a connected r-regular n-vertex graph G with random independent edge lengths, each uniformly distributed on [0, 1]. Let mst(G) be the expected length of a minimum spanning...
Alan M. Frieze, Miklós Ruszinkó, Lub...