Biblioteca Digital

17 resultados para Minimal-complexity classifier

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

Combining spatial and temporal logics: expressiveness vs. complexity

Relevância:

20.00% 20.00%

Publicador:

On the computational complexity of decidable fragments of first-order linear temporal logics

Relevância:

20.00% 20.00%

Publicador:

On the computational complexity of spatio-temporal logics

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:

Minimal Slicing and the Relationships Between Forms of Slicing

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:

Waiting time and complexity for matching patterns with automata

Relevância:

20.00% 20.00%

Publicador:

A basis of tiling motifs for generating repeated patterns and its complexity for higher quorum

Relevância:

20.00% 20.00%

Publicador:

Understanding decentralised control of resource allocation in a minimal multi-agent system

Relevância:

20.00% 20.00%

Publicador:

Spatial Complexity Metrics: An Investigation of Utility

Relevância:

20.00% 20.00%

Publicador:

An Approach to Understanding Program Comprehensibility Using Spatial Complexity, Concept Assignment & Typographical Style (poster)

Relevância:

20.00% 20.00%

Publicador:

An Initial Approach to Assessing Program Comprehensibility Using Spatial Complexity, Number of Concepts, and Typographical Style

Relevância:

20.00% 20.00%

Publicador:

A Priori Estimation of Classification Circut Complexity

Relevância:

20.00% 20.00%

Publicador:

On the Complexity of Train Assignment Problems

Relevância:

20.00% 20.00%

Publicador:

«
1
2
»