A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Filters
Efficient online computation of statement coverage
2005
Journal of Systems and Software
Preserved Fulltext
Evaluation of statement coverage is the problem of identifying the statements of a program that execute in one or more runs of a program. ...
In this paper we present a new approach to dynamically insert and remove instrumentation code to reduce the runtime overhead of statement coverage measurement. ...
Our GUI contains panels to run the application for statement coverage testing and to get online information about the statement coverage of the application. ...
doi:10.1016/j.jss.2004.12.021
fatcat:m6x3ytlg4bfwznsxwumklhbf3u
Online Coverage Planning for an Autonomous Weed Mowing Robot with Curvature Constraints
[article]
2021
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
We develop two online path planning algorithms that are able to utilize new information about weeds to optimize path length and ensure coverage. ...
Given a limited field of view, online path planning is necessary to detect weeds and plan paths to mow them. ...
Our online planners were shown to be computationally efficient and suitable for real-time path planning for mowing weeds. ...
arXiv:2111.10462v1
fatcat:x5hfwgblpzff3nzc7ifu5qvnmm
Implementation of Matching Tree Technique for Online Record Linkage
2013
IOSR Journal of Computer Engineering
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
However, the use of such techniques for online record linkage could pose a tremendous communication bottleneck in a distributed environment (where entity heterogeneity problem often encountered). ...
For the purpose of completing this goal, several types of problems ,must be solved by an organization .when same real world substance is used by different identifiers in different sources entity heterogeneity ...
Conclusion: Efficient techniques to facilitate record linkage decisions in a distributed, online setting. ...
doi:10.9790/0661-1143743
fatcat:dlhjk7huzbgufcdaulta23iyiy
Quality Characteristics of Mobile Learning Applications
2019
Informatică economică
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
We focus our attention above a software quality metric, the so-called statement code coverage (CC), to obtain a synergic effect between a blackbox approach and a white-box technique in order for developing ...
a particular branch of the Bucharest University of Economic Studies. ...
Acknowledgment Parts of this research have been published in the Proceedings of the 18th International Conference on Informatics in Economy, IE 2019 [26] . ...
doi:10.12948/issn14531305/23.4.2019.07
fatcat:msmv7kyn6ra33jjq3hzbk7fp4y
Verification Coverage
[article]
2017
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Inspired in the success that coverage metrics have achieved in industry, we propose to adapt the definition of coverage to the context of verification. ...
Moreover, we discuss a general approach to computing an under-approximation of such metric and a specific heuristic to improve the performance. ...
to compute a useful under-approximation of verification coverage efficiently? ...
arXiv:1706.03796v1
fatcat:oco2f6picnddpevdcn2qtjfyru
DU-Regs: Online Dynamic Approach to Visualize Impact Analysis for Regression Testing
2010
International Journal of Computer Applications
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
In this paper we propose a new online dynamic impact analysis technique called Definition Usage-Regression Test Selection (DU-Regs), which collects impact traces completely online i.e. during execution ...
Impact Analysis is a way to estimate the impact of such changes either before or after the change is made. ...
It also works at the method level, but uses coverage, rather than trace, information to compute impact sets. ...
doi:10.5120/411-609
fatcat:rc4apxyikbhopbu4x7alatqd4e
Coverage Path Planning Methods Focusing on Energy Efficient and Cooperative Strategies for Unmanned Aerial Vehicles
2022
Sensors
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
The coverage path planning (CPP) algorithms aim to cover the total area of interest with minimum overlapping. The goal of the CPP algorithms is to minimize the total covering path and execution time. ...
Likewise, we aim to present a comparison between energy efficient CPP algorithms and directions for future research. ...
Institutional Review Board Statement: Not applicable. Informed Consent Statement: Not applicable.
Conflicts of Interest: The authors declare no conflict of interest. ...
doi:10.3390/s22031235
pmid:35161979
pmcid:PMC8839296
fatcat:fhi5nbxz6vfa7h3qw7cjs667bq
Coverage evaluation of post-silicon validation tests with virtual prototypes
2014
Design, Automation & Test in Europe Conference & Exhibition (DATE), 2014
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2015; you can also visit the original URL.
The file type is application/pdf.
We first capture necessary data from a concrete execution of the virtual prototype within a virtual platform under a given test, and then compute the test coverage by efficiently replaying this execution ...
We propose an online-capture offline-replay approach to coverage evaluation of post-silicon validation tests with virtual prototypes for estimating silicon device test coverage. ...
We then compute the test coverage by efficiently replaying captured data offline on the virtual prototype itself. ...
doi:10.7873/date.2014.331
dblp:conf/date/CongLYX14
fatcat:jxwwmmt6ujdvbhpi5tdjehsxky
Retrieval, Crawling and Fusion of Entity-centric Data on the Web
[chapter]
2017
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
On the one hand, recommendation, linking, profiling and retrieval can provide efficient means to enable discovery and search of entity-centric data, specifically when dealing with traditional knowledge ...
Data vary heavily with respect to their scale, quality, coverage or dynamics, what poses challenges for tasks such as entity retrieval or search. ...
In addition, the author expresses his gratitude to all funding bodies that enabled the presented research through a variety of funding programs. ...
doi:10.1007/978-3-319-53640-8_1
fatcat:bilhfrwhgvgwnfm3wub4g55lr4
Automated path testing using the negative selection algorithm
2017
International Journal of Computational Vision and Robotics
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
The experimental results show that the proposed algorithm is more efficient in time of execution and more effective in the generation of test data when compared with random testing and genetic algorithm ...
Software testing is an important step in the software development process, accounting for more than 50% of software development cost as it is laborious and time-consuming. ...
The author also would like to thank Ministry of Higher Education & Scientific Research of Iraq and University of Mosul for sponsoring the research. ...
doi:10.1504/ijcvr.2017.10001815
fatcat:ngmv6bjpkbay7mfm24v4ngwuom
CPPNet: A Coverage Path Planning Network
[article]
2021
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
It is shown that CPPNet provides near-optimal solutions while requiring significantly less computational time, thus enabling real-time coverage path planning in partially unknown and dynamic environments ...
This paper presents a deep-learning based CPP algorithm, called Coverage Path Planning Network (CPPNet). ...
The advantages of CPPNet are as follows: it i) produces near-optimal coverage trajectories, ii) efficiently works in environments with complex shapes, and iii) is computationally efficient for real-time ...
arXiv:2108.01626v1
fatcat:5damwix4gzavbeyuif4sxvcdie
Parallel Mixed Mode Surveys on Consumer Attitude towards Fresh Produce
2012
Business and Management Research
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
., a face to face interview and an online survey with each required different sampling technique and questioning methods. ...
This paper investigates the effect of parallel mixed mode surveys on findings of a study on the Malaysian consumers' attitude towards buying of fresh produce from the large retail stores. ...
Statement
FTF
Online
Difference
T test
Prob. ...
doi:10.5430/bmr.v1n3p51
fatcat:jjsz357wjrhobgrp2f6k3oapdi
A Test Case Prioritization Genetic Algorithm guided by the Hypervolume Indicator
2018
IEEE Transactions on Software Engineering
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
An empirical study conducted with respect to five state-of-the-art techniques shows that (i) HGA is more cost-effective, (ii) HGA improves the efficiency of Test Case Prioritization, (iii) HGA has a stronger ...
branch coverage. ...
of statement coverage (APSC c ). ...
doi:10.1109/tse.2018.2868082
fatcat:t7alwu7aifctrb6fb7sioyzp5e
An Investigation into the Use of Mutation Analysis for Automated Program Repair
[chapter]
2017
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
This motivates the need for more efficient search techniques. We propose to use the test case results of candidate patches to localise suitable fix locations. ...
Based on the findings of this analysis, we propose a number of mutation-based fault localisation techniques, which we subsequently evaluate by measuring how accurately they locate the statements at which ...
Any opinions, findings, or recommendations expressed are those of the authors and do not necessarily reflect those of the US Government. ...
doi:10.1007/978-3-319-66299-2_7
fatcat:pxwruo4gc5emjelnsanv3ugccq
Approximation Vector Machines for Large-scale Online Learning
[article]
2017
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Other Versions
One of the most challenging problems in kernel online learning is to bound the model size and to promote the model sparsity. ...
Sparse models not only improve computation and memory usage, but also enhance the generalization capacity, a principle that concurs with the law of parsimony. ...
Furthermore, six online algorithms in general have significant advantages against the batch methods in computational efficiency, especially when running on large-scale datasets. ...
arXiv:1604.06518v3
fatcat:yuuwnu2yhjgrjfisjsd3iwb6fy
« Previous
Showing results 1 — 15 out of 57,098 results