Avoiding spurious submovement decompositions. II: A scattershot algorithm (Q2373228): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q48452836, #quickstatements; #temporary_batch_1712443714953 |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: A modification to the rational boundary Gregory patch / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Quantization of human motions and learning of accurate movements / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An Algorithm for the Traveling Salesman Problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Avoiding spurious submovement decompositions: a globally optimal algorithm / rank | |||
Normal rank | |||
Latest revision as of 11:21, 26 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Avoiding spurious submovement decompositions. II: A scattershot algorithm |
scientific article |
Statements
Avoiding spurious submovement decompositions. II: A scattershot algorithm (English)
0 references
17 July 2007
0 references
