Pages that link to "Item:Q686743"
From MaRDI portal
The following pages link to Orienting polygonal parts without sensors (Q686743):
Displaying 18 items.
- Combinatorial filter reduction: special cases, approximation, and fixed-parameter tractability (Q730503) (← links)
- Integer linear programming formulations of the filter partitioning minimization problem (Q782755) (← links)
- Synchronizing automata preserving a chain of partial orders (Q840772) (← links)
- Synchronizing automata with a letter of deficiency 2 (Q880170) (← links)
- Computing fence designs for orienting parts (Q1265285) (← links)
- The complexity of oblivious plans for orienting and distinguishing polygonal parts (Q1900891) (← links)
- Computing grasp functions (Q1917051) (← links)
- Černý's conjecture and the road colouring problem (Q2074216) (← links)
- Computational complexity of synchronization under sparse regular constraints (Q2140506) (← links)
- Bounding the locus of the center of mass for a part with shape variation (Q2248739) (← links)
- Reprint of: Bounding the locus of the center of mass for a part with shape variation (Q2341693) (← links)
- COMPUTING PUSH PLANS FOR DISK-SHAPED ROBOTS (Q3459360) (← links)
- Synchronizing Automata Preserving a Chain of Partial Orders (Q3503892) (← links)
- Synchronizing Automata and the Černý Conjecture (Q3540093) (← links)
- Friction and part curvature in parallel‐ jaw grasping (Q4836090) (← links)
- Efficient workspace generation for binary manipulators with many actuators (Q4836091) (← links)
- Orienting polyhedral parts by pushing (Q5959552) (← links)
- Particle computation: complexity, algorithms, and logic (Q6150976) (← links)