Pages that link to "Item:Q1170036"

The following pages link to Time-optimal solution of the firing-squad-synchronization-problem for n- dimensional rectangles with the general at an arbitrary position (Q1170036):

Displaying 18 items.

• The firing squad synchronization problem on CA with multiple updating cycles (Q475400) (← links)
• Bounding the firing synchronization problem on a ring (Q596090) (← links)
• A class of time-optimum FSSP algorithms for multi-dimensional cellular arrays (Q907212) (← links)
• The synchronization of nonuniform networks of finite automata (Q1187031) (← links)
• On optimal solutions to the firing squad synchronization problem (Q1349868) (← links)
• Smaller solutions for the firing squad (Q1605305) (← links)
• Faster synchronization in P systems (Q1761716) (← links)
• Complexity of perceptron recognition for a class of geometric patterns. (Q1874386) (← links)
• The minimum firing time of the generalized firing squad synchronization problem for squares (Q2253198) (← links)
• Time-Optimum Smaller-State Synchronizers for Cellular Automata (Q2944884) (← links)
• A New Optimum-Time Firing Squad Synchronization Algorithm for Two-Dimensional Rectangle Arrays: One-Sided Recursive Halving Based (Q3091468) (← links)
• THE FIRING SQUAD SYNCHRONIZATION PROBLEM ON SQUARES, TORUSES AND RINGS (Q3444850) (← links)
• An intrinsically non minimal-time Minsky-like 6-states solution to the Firing Squad synchronization problem (Q3514634) (← links)
• A Seven-State Time-Optimum Square Synchronizer (Q4931212) (← links)
• Generalized FSSP on Hexagonal Tiling: Towards Arbitrary Regular Spaces (Q5501615) (← links)
• The firing squad synchronization problem on Cayley graphs (Q5915397) (← links)
• A design of generalized minimum-state-change FSSP algorithms and their implementations (Q6062008) (← links)
• Revisiting the cutting of the firing squad synchronization (Q6084230) (← links)