Search-based software engineering (SBSE) applies metaheuristic search techniques such as genetic algorithms, simulated annealing and tabu search to software engineering problems. Many activities in software engineering can be stated as optimization problems. Optimization techniques of operations research such as linear programming or dynamic programming are often impractical for large scale software engineering problems because of their computational complexity or their assumptions on the problem structure. Researchers and practitioners use metaheuristic search techniques, which impose little assumptions on the problem structure, to find near-optimal or "good-enough" solutions.
| Attributes | Values |
|---|
| rdf:type
| |
| rdfs:label
| - Ingeniería del software basada en búsqueda (es)
- Search-based software engineering (en)
- Otimização em engenharia de software (pt)
|
| rdfs:comment
| - A Otimização em engenharia de software é uma recente área de pesquisa que trata da aplicação de técnicas de otimização matemática para a resolução de problemas complexos da engenharia de software. Apesar de já existirem trabalhos relacionados nas últimas décadas do século XX o campo obteve maior atenção e abrangência a partir de 2001 com a publicação de um artigo que deu a denominação "Search-based Software Engineering" ao campo. (pt)
- Ingeniería del Software Basada en Búsqueda (ISBB), proviene del término originario inglés Search-Based Software Engineering (SBSE). Alude a la aplicación de técnicas de optimización ya utilizadas en otros campos de la ingeniería y de la ciencia, como algoritmos genéticos, simulated annealing o búsqueda tabú al campo de la Ingeniería del Software. El motivo para importar este tipo de metodologías es la interpretación de que la naturaleza de los problemas con los que a menudo se enfrenta la ingeniería del software cumple razonablemente con los requisitos para los que ese tipo de soluciones son aceptables, tales como problemas con muchos parámetros de decisión, con unas restricciones en contradicción e interrelacionadas y unos requisitos vagos o imprecisos donde se busca una solución óptima o (es)
- Search-based software engineering (SBSE) applies metaheuristic search techniques such as genetic algorithms, simulated annealing and tabu search to software engineering problems. Many activities in software engineering can be stated as optimization problems. Optimization techniques of operations research such as linear programming or dynamic programming are often impractical for large scale software engineering problems because of their computational complexity or their assumptions on the problem structure. Researchers and practitioners use metaheuristic search techniques, which impose little assumptions on the problem structure, to find near-optimal or "good-enough" solutions. (en)
|
| dcterms:subject
| |
| Wikipage page ID
| |
| Wikipage revision ID
| |
| Link from a Wikipage to another Wikipage
| |
| Link from a Wikipage to an external page
| |
| sameAs
| |
| dbp:wikiPageUsesTemplate
| |
| has abstract
| - Ingeniería del Software Basada en Búsqueda (ISBB), proviene del término originario inglés Search-Based Software Engineering (SBSE). Alude a la aplicación de técnicas de optimización ya utilizadas en otros campos de la ingeniería y de la ciencia, como algoritmos genéticos, simulated annealing o búsqueda tabú al campo de la Ingeniería del Software. El motivo para importar este tipo de metodologías es la interpretación de que la naturaleza de los problemas con los que a menudo se enfrenta la ingeniería del software cumple razonablemente con los requisitos para los que ese tipo de soluciones son aceptables, tales como problemas con muchos parámetros de decisión, con unas restricciones en contradicción e interrelacionadas y unos requisitos vagos o imprecisos donde se busca una solución óptima o casi óptima. (es)
- Search-based software engineering (SBSE) applies metaheuristic search techniques such as genetic algorithms, simulated annealing and tabu search to software engineering problems. Many activities in software engineering can be stated as optimization problems. Optimization techniques of operations research such as linear programming or dynamic programming are often impractical for large scale software engineering problems because of their computational complexity or their assumptions on the problem structure. Researchers and practitioners use metaheuristic search techniques, which impose little assumptions on the problem structure, to find near-optimal or "good-enough" solutions. SBSE problems can be divided into two types:
* black-box optimization problems, for example, assigning people to tasks (a typical combinatorial optimization problem).
* white-box problems where operations on source code need to be considered. (en)
|
![[RDF Data]](/fct/images/sw-rdf-blue.png)
![[cxml]](/fct/images/cxml_doc.png)
![[csv]](/fct/images/csv_doc.png)
![[text]](/fct/images/ntriples_doc.png)
![[turtle]](/fct/images/n3turtle_doc.png)
![[ld+json]](/fct/images/jsonld_doc.png)
![[rdf+json]](/fct/images/json_doc.png)
![[rdf+xml]](/fct/images/xml_doc.png)
![[atom+xml]](/fct/images/atom_doc.png)
![[html]](/fct/images/html_doc.png)