221 search results - page 27 / 45 » Graph matching with type constraints on nodes and edges |
CC
2009
Springer
14 years 9 days ago
2009
Springer
Single-assignment languages with copy semantics have a very simple and approachable programming model. A na¨ıve implementation of the copy semantics that copies the result of eve...
IDEAL
2003
Springer
14 years 26 days ago
2003
Springer
ERA is a multi-agent oriented method for solving constraint satisfaction problems [5]. In this method, agents make decisions based on the information obtained from their environmen...
CORR
2011
Springer
13 years 2 months ago
2011
Springer
In this paper, we develop new methods for the analysis of decentralized control systems and we apply them to formation control problems. The basic set-up consists of a system with...
KDD
2005
ACM
14 years 8 months ago
2005
ACM
How do real graphs evolve over time? What are "normal" growth patterns in social, technological, and information networks? Many studies have discovered patterns in stati...
CGF
2010
13 years 7 months ago
2010
Social networks collected by historians or sociologists typically have a large number of actors and edge attributes. Applying social network analysis (SNA) algorithms to these net...