Biblioteca Digital

48 resultados para Proximal algorithms

Efficient algorithms for finding a longest common increasing subsequence

Relevância:

20.00% 20.00%

Publicador:

Efficient Algorithms for Finding the Maximum Number of Disjoint Paths in Grids

Relevância:

20.00% 20.00%

Publicador:

Off-Line Algorithms for Minimizing Total Flow Time in Broadcast Scheduling

Relevância:

20.00% 20.00%

Publicador:

Efficient Algorithms for Finding a Longest Common Increasing Subsequence

Relevância:

20.00% 20.00%

Publicador:

Competitive Analysis of On-line Stream Merging Algorithms

Relevância:

20.00% 20.00%

Publicador:

Meta-heuristic Search Algorithms for Regression Test Case Prioritization

Relevância:

20.00% 20.00%

Publicador:

Slicing algorithms are minimal for programs which can be expressed as linear, free, liberal schemas

Relevância:

20.00% 20.00%

Publicador:

Software Engineering using Metaheuristic INnovative ALgorithms

Relevância:

20.00% 20.00%

Publicador:

Evolving Transformation Sequences using Genetic Algorithms

Relevância:

20.00% 20.00%

Publicador:

Mutation Testing Using Genetic Algorithms: A Co-evolution Approach

Relevância:

20.00% 20.00%

Publicador:

Computing Unique Input/Output Sequences Using Genetic Algorithms

Relevância:

20.00% 20.00%

Publicador:

Results From a Large--Scale Study of Performance Optimization Techniques for Source Code Analyses Based on Graph Reachability Algorithms

Relevância:

20.00% 20.00%

Publicador:

SEMINAL: Software Engineering using Metaheuristic INnovative ALgorithms

Relevância:

20.00% 20.00%

Publicador:

Genetic Algorithms: Growing Your Own Code

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:

«
1
2
3
4
»