Biblioteca Digital

31 resultados para Traveling-Salesman Problem

Reformulating Software Engineering as a Search Problem

Relevância:

20.00% 20.00%

Publicador:

The SEMINAL Workshop: Reformulating Software Engineering as a Metaheuristic Search Problem

Relevância:

20.00% 20.00%

Publicador:

The Multi-Objective Next Release Problem

Relevância:

20.00% 20.00%

Publicador:

Search Based Approaches to Component Selection and Prioritization for the Next Release Problem

Relevância:

20.00% 20.00%

Publicador:

Search--based approaches to the component selection and prioritization problem

Relevância:

20.00% 20.00%

Publicador:

Necklace Swap Problem for Rhythmic Similarity Measures

Relevância:

20.00% 20.00%

Publicador:

Approximation algorithm for the cyclic swap problem

Relevância:

20.00% 20.00%

Publicador:

The complexity of the minimum k-cover problem

Relevância:

20.00% 20.00%

Publicador:

New complexity results for the k-covers problem

Relevância:

20.00% 20.00%

Publicador:

A fast and practical bit-vector algorithms for the longest common subsequence problem

Relevância:

20.00% 20.00%

Publicador:

Approximating the 2-Interval Pattern Problem

Relevância:

20.00% 20.00%

Publicador:

On the Wake-Up Problem in Radio Networks

Relevância:

20.00% 20.00%

Publicador:

Filtration Structures and the Cut Down Problem for Abduction

Relevância:

20.00% 20.00%

Publicador:

Music Retrieval Algorithms for The Lead Sheet Problem

Relevância:

20.00% 20.00%

Publicador:

Linear time algorithm for the longest common repeat problem

Relevância:

20.00% 20.00%

Publicador:

«
1
2
3
»