Sciweavers

3757 search results - page 587 / 752
» The overlap number of a graph
Sort
View
FCS
2009
15 years 4 months ago
Spectral Analysis of Attractors in Random Boolean Network Models
Circuits and loops in graph systems can be used to model the attractors in gene-regulatory networks. The number of such attractors grows very rapidly with network size and even fo...
Kenneth A. Hawick
IJAC
2010
96views more  IJAC 2010»
15 years 3 months ago
Coxeter Covers of the Classical Coxeter Groups
Let C(T) be a generalized Coxeter group, which has a natural map onto one of the classical Coxeter groups, either Bn or Dn. Let CY (T) be a natural quotient of C(T), and if C(T) is...
Meirav Amram, Robert Shwartz, Mina Teicher
AUTOMATICA
2011
15 years 1 months ago
Distributed averaging on digital erasure networks
Iterative distributed algorithms are studied for computing arithmetic averages over networks of agents connected through memoryless broadcast erasure channels. These algorithms do...
Ruggero Carli, Giacomo Como, Paolo Frasca, Federic...
CDC
2010
IEEE
118views Control Systems» more  CDC 2010»
15 years 1 months ago
On optimal cooperative patrolling
This work considers the problem of designing optimal multi-agent trajectories to patrol an environment. As performance criterion for optimal patrolling we consider the worst-case t...
Fabio Pasqualetti, Antonio Franchi, Francesco Bull...
DCC
2011
IEEE
15 years 1 months ago
Sparse Boolean equations and circuit lattices
Abstract. A system of Boolean equations is called sparse if each equation depends on a small number of variables. Finding efficiently solutions to the system is an underlying hard ...
Igor Semaev