Sciweavers

2503 search results - page 72 / 501
» A study of 3-arc graphs
Sort
View
FOCS
2009
IEEE
16 years 22 days ago
Convergence to Equilibrium in Local Interaction Games
— We study a simple game theoretic model for the spread of an innovation in a network. The diffusion of the innovation is modeled as the dynamics of a coordination game in which ...
Andrea Montanari, Amin Saberi
AB
2007
Springer
16 years 5 days ago
Relating Attractors and Singular Steady States in the Logical Analysis of Bioregulatory Networks
Abstract. In 1973 R. Thomas introduced a logical approach to modeling and analysis of bioregulatory networks. Given a set of Boolean functions describing the regulatory interaction...
Heike Siebert, Alexander Bockmayr
IPPS
2006
IEEE
16 years 14 hour ago
Plan switching: an approach to plan execution in changing environments
The execution of a complex task in any environment requires planning. Planning is the process of constructing an activity graph given by the current state of the system, a goal st...
Han Yu, Dan C. Marinescu, Annie S. Wu, Howard Jay ...
AAIM
2005
Springer
122views Algorithms» more  AAIM 2005»
15 years 11 months ago
Complexity of Minimal Tree Routing and Coloring
Let G be a undirected connected graph. Given a set of g groups each being a subset of V (G), tree routing and coloring is to produce g trees in G and assign a color to each of them...
Xujin Chen, Xiao-Dong Hu, Xiaohua Jia
130
Voted
FCT
2005
Springer
15 years 11 months ago
Reconstructing Many Partitions Using Spectral Techniques
A partitioning of a set of n items is a grouping of these items into k disjoint, equally sized classes. Any partition can be modeled as a graph. The items become the vertices of th...
Joachim Giesen, Dieter Mitsche