Sciweavers

608 search results - page 9 / 122
» Random Systems with Complete Connections
Sort
View
FCS
2009
13 years 7 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
IJRR
2002
87views more  IJRR 2002»
13 years 9 months ago
Complete Path Planning for Closed Kinematic Chains with Spherical Joints
We study the path planning problem, without obstacles, for closed kinematic chains with n links connected by spherical joints in space or revolute joints in the plane. The configu...
Jeffrey C. Trinkle, R. James Milgram
CORR
2007
Springer
110views Education» more  CORR 2007»
13 years 9 months ago
Relations between random coding exponents and the statistical physics of random codes
The partition function pertaining to finite–temperature decoding of a (typical) randomly chosen code is known to have three types of behavior, corresponding to three phases in ...
Neri Merhav
IJBC
2006
82views more  IJBC 2006»
13 years 9 months ago
How Crucial is Small World Connectivity for Dynamics?
We study the dynamical behaviour of the collective field of chaotic systems on small world lattices. Coupled neuronal systems as well as coupled logistic maps are investigated. We...
Prashant M. Gade, Sudeshna Sinha
SEFM
2005
IEEE
14 years 3 months ago
Experimental Evaluation of FSM-Based Testing Methods
The development of test cases is an important issue for testing software, communication protocols and other reactive systems. A number of methods are known for the development of ...
Rita Dorofeeva, Nina Yevtushenko, Khaled El-Fakih,...