Results 251 to 260 of about 525,238 (287)
Some of the next articles are maybe not open access.
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, Chunyu Ai, Guantao Chen
exaly +2 more sources
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, Chunyu Ai, Guantao Chen
exaly +2 more sources
A Neural Network Approach to Complete Coverage Path Planning
IEEE Transactions on Systems, Man, and Cybernetics, 2004Complete 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
Mobile-robot navigation with complete coverage of unstructured environments
There are some mobile-robot applications that require the complete coverage of an unstructured environment. Examples are humanitarian de-mining and floor-cleaning tasks.
P Gonzalez De Santos
exaly +2 more sources
BSA: A Complete Coverage Algorithm
Proceedings of the 2005 IEEE International Conference on Robotics and Automation, 2006The 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.
Enrique González +4 more
openaire +1 more source
Underwater gliders are being increasingly used for data collection, and the development of methods for optimizing their routes has become a topic of active research.
Guangjie Han, Tongwei Zhang, Hao Wang
exaly +2 more sources
Design for Testability for Complete Test Coverage
IEEE Design & Test of Computers, 1984Some design-for-testability techniques, such as level-sensitive scan design, scan path, and scan/set, reduce test pattern generation of sequential circuits to that of combinational circuits by enhancing the controllability and/or observability of all the memory elements. However, even for combinational circuits, 100 percent test coverage of large-scale
Akira Motohara, Hideo Fujiwara
openaire +1 more source
Generating concise assertions with complete coverage
Proceedings of the 23rd ACM international conference on Great lakes symposium on VLSI, 2013Assertions are valuable and commonly applied to formal verification and simulation-based verification in IC design flow. Unfortunately, assertion generation is a time-consuming process that depends heavily on human efforts. Some dynamic methods based on simulation and static methods based on structure analysis are proposed to automate assertion ...
Chen-Hsuan Lin 0002 +2 more
openaire +1 more source
Taking Turns in Complete Coverage for Multiple Robots
2019Coverage is a canonical task where a robot or a group of robots are required to visit every point in a given work area, typically within the shortest possible time. Previous work on offline coverage highlighted the benefits of determining a circular coverage path, divided into segments for different robots (if more than one).
Lee-or Alon, Noa Agmon, Gal A. Kaminka
openaire +1 more source
Completeness of Press Coverage of the 1960 Campaign
Journalism Quarterly, 1961Using a sample of 90 dailies with reference to 23 presidential campaign events, two University of North Carolina journalism professors report on the completeness of coverage of events and the amount of coverage made available to the average reader—a figure ranging between 41% and 60%.
Wayne A. Danielson, John B. Adams
openaire +1 more source

