Sciweavers

4507 search results - page 316 / 902
» Generalized Binet dynamics
Sort
View
UC
2005
Springer
16 years 3 days ago
On Computational Complexity of Counting Fixed Points in Symmetric Boolean Graph Automata
Abstract. We study computational complexity of counting the fixed point configurations (FPs) in certain classes of graph automata viewed as discrete dynamical systems. We prove t...
Predrag T. Tosic, Gul A. Agha
ERLANG
2004
ACM
16 years 2 days ago
Structured programming using processes
Structured Programming techniques are applied to a personal accounting software application implemented in erlang as a demonstration of the utility of processes as design construc...
Jay Nelson
ICSOC
2004
Springer
16 years 16 hour ago
Smart monitors for composed services
Service-based approaches are widely used to integrate heterogenous systems. Web services allow for the definition of highly dynamic systems where components (services) can be dis...
Luciano Baresi, Carlo Ghezzi, Sam Guinea
CODES
2003
IEEE
15 years 12 months ago
A codesigned on-chip logic minimizer
Boolean logic minimization is traditionally used in logic synthesis tools running on powerful desktop computers. However, logic minimization has recently been proposed for dynamic...
Roman L. Lysecky, Frank Vahid
KDD
2009
ACM
179views Data Mining» more  KDD 2009»
15 years 11 months ago
A viewpoint-based approach for interaction graph analysis
Recent innovations have resulted in a plethora of social applications on the Web, such as blogs, social networks, and community photo and video sharing applications. Such applicat...
Sitaram Asur, Srinivasan Parthasarathy