Solving the task variant allocation problem in distributed robotics.

Auton Robots · 2018 · PMC6417410 · PMID 30956403

Europe PMC DOI

hedged sentence

—

closest p

—

boldest claim

The sentences

a clear trendno p-value reported

6 illustrate a clear trend that answers RQ2A : in most cases, constraint programming produces superior results in the same amount of time, and is our preferred anytime solution method.

also in 19,460 other papers

Quoted from the open-access full text in Europe PMC under the licence the publisher applied. The sentence is reproduced exactly as published; the emphasis is ours.