Friday, May 27, 2016

 

 



Soy un nuevo usuario

Olvidé mi contraseña

Entrada usuarios

Lógica Matemáticas Astronomía y Astrofísica Física Química Ciencias de la Vida
Ciencias de la Tierra y Espacio Ciencias Agrarias Ciencias Médicas Ciencias Tecnológicas Antropología Demografía
Ciencias Económicas Geografía Historia Ciencias Jurídicas y Derecho Lingüística Pedagogía
Ciencia Política Psicología Artes y Letras Sociología Ética Filosofía


Harish Mittal, Pradeep Bhatia A comparative study of conventional effort estimation and fuzzy effort estimation based on Triangular Fuzzy Numbers

1) La descarga del recurso depende de la página de origen
2) Para poder descargar el recurso, es necesario ser usuario
    registrado en Universia


  Descargar recurso

Detalles del recurso

Pertenece a: CiteSeerX Scientific Literature Digital Library and Search Engine  

Descripción: Effective cost estimation is the most challenging activity in software development. Software cost estimation is not an exact science. However it can be transformed from a black art to a series of systematic steps that provide estimate with acceptable risk. Effort is a function of size. For estimating effort first we face sizing problem. In direct approach size is measured in lines of code (LOC). In indirect approach, size is represented as function points (FP). In this paper we use indirect approach. Fuzzy logic is used to find fuzzy functional points and then the result is defuzzified to get the functional points and hence the size estimation in person hours. Triangular fuzzy numbers are used to represent the linguistic terms in Function Point Analysis (FPA) complexity matrixes We can optimise the results for any application by varying the fuzziness of the triangular fuzzy numbers.

Autor(es): Harish Mittal -  Pradeep Bhatia - 

Id.: 46014529

Idioma: English  - 

Versión: 1.0

Estado: Final

Tipo:  application/pdf - 

Palabras claveFP - 

Tipo de recurso: Texto Narrativo  - 

Tipo de Interactividad: Expositivo

Nivel de Interactividad: muy bajo

Audiencia: Estudiante  -  Profesor  -  Autor  - 

Estructura: Atomic

Coste: no

Copyright: sí

: Metadata may be used without restrictions as long as the oai identifier remains attached to it.

Formatos:  application/pdf - 

Requerimientos técnicos:  Browser: Any - 

Relación: [IsBasedOn] http://cssjournals.com/journals/ijcss/volume1/issue4/ijcss-23.pdf
[References] 10.1.1.137.5341

Fecha de contribución: 17-jul-2009

Contacto:

Localización:


Otros recursos del mismo autor(es)

  1. Anesthetic management for patients with perforation peritonitis
  2. Anaesthetic Challenges in Molar Pregnancy Gestational Trophoblastic Disease (GTD) is a spectrum of tumours with a wide range of biologic behav...
  3. A Comparative Study of Conventional Effort Estimation and Fuzzy Effort Estimation Based on Triangular Fuzzy Numbers Effective cost estimation is the most challenging activity in software development. Software cost es...
  4. Attrition in Knowledge Industry- Issues and Challenges Attrition is a phenomenon affecting any business organization in the industry. Over the past...
  5. Single Stage Transanal Pull-Through for Hirschsprung’s Disease in Neonates: Our Early Experience

    Objective: Hirschsprung’s disease is one of the common causes of intestinal obst...


Otros recursos de la misma colección

  1. TIME-DEPENDENT STOCHASTIC SHORTEST PATH(S) ALGORITHMS FOR A SCHEDULED TRANSPORTATION NETWORK Following on from our work concerning travellers’ preferences in public transportation networks (Wu ...
  2. Point-to-Point Shortest Path Algorithms with Preprocessing This is a survey of some recent results on point-to-point shortest path algorithms. This classical o...
  3. Hub Label Compression The hub labels (HL) algorithm is the fastest known technique for computing driving times on road net...
  4. Customizable Point-of-Interest Queries in Road Networks We present a unified framework for dealing with exact point-of-interest (POI) queries in dynamic con...
  5. PHAST: hardware-accelerated shortest path trees We present a novel algorithm to solve the nonnegative single-source shortest path problem on road ne...

Valoración de los usuarios

No hay ninguna valoración para este recurso.Sea el primero en valorar este recurso.
 

Busque un recurso