top of page


Public·161 membres

PATCHED Paragon HFS For Windows 10.0 Key

LINK ->>>

Interest in metrics that measure software quality has increased significantly in recent years, motivated by the need to evaluate existing software for areas such as robustness, maintainability, reliability, etc. In this paper, we present a new approach to measure the perceived quality of software systems. An extensive review of the literature shows the need for tools to measure perceived quality is gaining more and more attention in terms of activities. But most of these activities are being conducted without any formal approach and after a short time of operation, whatever approach is adopted, it could be hardly measured. We propose at the basis of our approach a graph theory based formal modeling that enables this operation. We use this formal model to conduct a research study that describes, using models and small sub models, a set of perceived quality processes. © 2013 Springer-Verlag.

We present a method to extract structural information from a graph representation of a software system. The starting point is a directed graph representing the model of a software system. Using the graph rules, we extract structural information from the graph that could eventually be used to support a variety of graph-based operations, such as graph traversal and link analysis. Qualitative and preliminary quantitative evaluation of our approach on three software systems shows the potential to develop a set of integrated visualization tools based on the extracted graph representation. © 2013 Elsevier.

Code generation is an important area in software engineering since an increase in code generation speed produces a substantial enhancement of time-to-market. The worst case scenario is to design an algorithm that is complex and slow, like many state-of-the-art visit-based algorithms for planning. We present a new code generation technique based on the integrate-prune-shape-explore (iPSE) algorithm. This technique introduces an additional path search strategy. It also reduces the complexity of the standard depth-based path search strategy. We support this new approach with several experiments on algorithms that were optimized by the original iPSE algorithm. Also, we adapted the iPSE algorithm for a more compact internal representation. The experiments were performed on the planning problems specified by the game precursor. Copyright 2013 IEEE. d2c66b5586

À propos

Bienvenue dans le groupe ! Vous pouvez communiquer avec d'au...


bottom of page