Results 241 to 250 of about 1,787,006 (286)

Genome assembly and annotation of the biofuel- and bioproduct-relevant microalga <i>Nannochloropsis oceanica</i> CCAP849/10. [PDF]

Microbiol Resour Announc
Starkenburg SR, Biondi TC, Kruse CPS, Eng W, Reardon KF, Kassaw T, Hovde BT, Peers G.   +7 more
europepmc   +1 more source

Complete Root Coverage with Subepithelial Connective Tissue Graft: Case Series

, 2017
ZEYTİNCİ, TUĞÇE, GÜZELDEMİR AKÇAKANAT, ESRA   +1 more
openaire   +2 more sources

Some of the next articles are maybe not open access.

Related searches:

Transforming Complete Coverage Algorithms to Partial Coverage Algorithms for Wireless Sensor Networks

IEEE Transactions on Parallel and Distributed Systems, 2011
The complete area coverage problem in Wireless Sensor Networks (WSNs) has been extensively studied in the literature. However, many applications do not require complete coverage all the time. For such applications, one effective method to save energy and prolong network lifetime is to partially cover the area.
Yingshu Li, Yi Zhao
exaly   +2 more sources

A Neural Network Approach to Complete Coverage Path Planning

IEEE Transactions on Systems, Man, and Cybernetics, 2004
Complete coverage path planning requires the robot path to cover every part of the workspace, which is an essential issue in cleaning robots and many other robotic applications such as vacuum robots, painter robots, land mine detectors, lawn mowers, automated harvesters, and window cleaners.
Simon X Yang, Chaomin Luo
exaly   +3 more sources

BSA: A Complete Coverage Algorithm

Proceedings of the 2005 IEEE International Conference on Robotics and Automation, 2006
The Backtracking Spiral Algorithm (BSA) is a coverage strategy for mobile robots based on the use of spiral filling paths; in order to assure the completeness, unvisited regions are marked and covered by backtracking mechanism. The BSA basic algorithm is designed to work in an environment modeled by a coarse-grain grid.
E. Gonzalez, O. Alvarez, Y. Diaz, C. Parra, C. Bustacara   +4 more
openaire   +1 more source

Complete coverage and point coverage in randomly distributed sensor networks

Automatica, 2009
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Chen, Xi, Ho, Yu-Chi, Bai, Hongxing
openaire   +2 more sources

From Multi-Target Sensory Coverage to Complete Sensory Coverage: An Optimization-Based Robotic Sensory Coverage Approach

2021 IEEE International Conference on Robotics and Automation (ICRA), 2021
This paper considers progressively more demanding off-line shortest path sensory coverage problems in an optimization framework. In the first problem, a robot finds the shortest path to cover a set of target nodes with its sensors. Because this mixed integer nonlinear optimization problem (MINLP) is NP-hard, we develop a polynomial-time approximation ...
Burdick, Joel W., Bouman, Amanda, Rimon, Elon   +2 more
openaire   +2 more sources

Cutting efficiency in complete coverage preparation

The Journal of the American Dental Association, 1969
The object of cutting efficiency is to remove the maximum amount of tooth structure with the minimum amount of effort and time, and several factors are involved. Cutting efficiency may be improved with a technic that allows bulk removal of tooth structure to depths controlled by the instrument.
openaire   +2 more sources

Complete Multi-Objective Coverage with PaCcET

Proceedings of the Companion Publication of the 2015 Annual Conference on Genetic and Evolutionary Computation, 2015
The Pareto Concavity Elimination Transformation (PaCcET) is a promising new development in multi-objective optimization. It transforms the objective space so that a computationally-cheap linear combination of objectives can attain (even concave) Pareto-optimal points.
Logan Yliniemi, Kagan Tumer
openaire   +1 more source