Sciweavers

1206 search results - page 55 / 242
» Arc-Flags in Dynamic Graphs
Sort
View
CDC
2008
IEEE
184views Control Systems» more  CDC 2008»
14 years 4 months ago
Almost sure convergence to consensus in Markovian random graphs
— In this paper we discuss the consensus problem for a network of dynamic agents with undirected information flow and random switching topologies. The switching is determined by...
Ion Matei, Nuno C. Martins, John S. Baras
ICCBR
2007
Springer
14 years 4 months ago
An Analysis of Case-Based Value Function Approximation by Approximating State Transition Graphs
We identify two fundamental points of utilizing CBR for an adaptive agent that tries to learn on the basis of trial and error without a model of its environment. The first link co...
Thomas Gabel, Martin Riedmiller
OTM
2007
Springer
14 years 4 months ago
Self-healing in Binomial Graph Networks
The number of processors embedded in high performance computing platforms is growing daily to solve larger and more complex problems. However, as the number of components increases...
Thara Angskun, George Bosilca, Jack Dongarra
WEBI
2004
Springer
14 years 3 months ago
Using Semantic Graphs in Clustering Process : Enhance Information Level
In this paper, we particularly focused our attention on how to enhance expressivity of ontologies when used as organized space values in a catalogue request process. Using the Wis...
Jean-Sébastien Brunner, Isabelle Berrien
CVPR
2003
IEEE
14 years 3 months ago
Graph-Theoretic Approach to Clustering and Segmentation
We develop a framework for the image segmentation problem based on a new graph-theoretic formulation of clustering. The approach is motivated by the analogies between the intuitiv...
Massimiliano Pavan, Marcello Pelillo