Results 211 to 220 of about 859,071 (262)
Research on path planning algorithms for Crawler transport robots in complex tunnels. [PDF]
PLoS OneYu T +9 more
europepmc +1 more source
Online Menopause Information-Seeking Search Patterns and Commercial Content Over 2 Decades.
JAMA Netw OpenFarina FR +5 more
europepmc +1 more source
Effectiveness of Intra-oral Non-skeletally Anchored Appliances in the Correction of Skeletal Class III Malocclusion in Growing Patients: A Systematic Review and Meta-Analysis of Randomized Controlled Trials. [PDF]
CureusKourbaj YM +6 more
europepmc +1 more source
Robust Fast 3D Beam Alignment for UAV-Assisted mmWave and Terahertz Communications. [PDF]
Sensors (Basel)Gafari L, Attaoui W, Sabir E, Driouch E.
europepmc +1 more source
Evaluation of reading performance in eyes simulated with different visual acuity and visual field impairment. [PDF]
BMC OphthalmolPeng PL, Hsu WT, Hsu WC.
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
On the Nonmonotone Line Search
Journal of Optimization Theory and Applications, 2002zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Y H Dai
exaly +2 more sources
Proceedings of the 48h IEEE Conference on Decision and Control (CDC) held jointly with 2009 28th Chinese Control Conference, 2009
In this paper we investigate discrete linear search and graph search problems. It is well-known that the Bounded Discrete Linear Search Problem (BDLSP) can be solved efficiently using a dynamic programming approach. However, we show that its generalization to the graph case—the Graph Search Problem (GSP)—is NP-complete. We further consider the Discrete
Hua Li, Edwin K. P. Chong
openaire +1 more source
In this paper we investigate discrete linear search and graph search problems. It is well-known that the Bounded Discrete Linear Search Problem (BDLSP) can be solved efficiently using a dynamic programming approach. However, we show that its generalization to the graph case—the Graph Search Problem (GSP)—is NP-complete. We further consider the Discrete
Hua Li, Edwin K. P. Chong
openaire +1 more source
Search on a Line with Faulty Robots
Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing, 2016zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jurek Czyzowicz +4 more
openaire +2 more sources