Biblioteca Digital

55 resultados para Graph Algorithms

em Department of Computer Science E-Repository - King's College London, Strand, London

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

Relevância:

40.00% 40.00%

Publicador:

Directed Acyclic Subsequence Graph - Overview

Relevância:

30.00% 30.00%

Publicador:

The cover time of the giant component of a random graph

Relevância:

30.00% 30.00%

Publicador:

A Higher-order Calculus for Graph Transformation

Relevância:

20.00% 20.00%

Publicador:

Call by value lambda-graph rewriting --- without rewriting

Relevância:

20.00% 20.00%

Publicador:

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:

A layered approach to extracting programs from proofs with an application in Graph Theory

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:

«
1
2
3
4
»