1686 search results - page 15 / 338 » Programs as polygraphs: computability and complexity |
CAISE
2003
Springer
15 years 2 months ago
2003
Springer
Abstract. This paper presents a method to compute metrics that predict maintainability of a system with respect to its event processing. The metrics reflect the complexity of event...
EUROCOLT
1999
Springer
15 years 1 months ago
1999
Springer
The present paper motivates the study of mind change complexity for learning minimal models of length-bounded logic programs. It establishes ordinal mind change complexity bounds ...
128
click to vote
CSL
2007
Springer
15 years 3 months ago
2007
Springer
Programs and Abstract Complexity A. Beckmann University of Wales Swansea Swansea, UK Axiom systems are ubiquitous in mathematical logic, one famous and well studied example being ï...
COMGEO
2008
ACM
14 years 9 months ago
2008
ACM
The flow complex is a geometric structure, similar to the Delaunay tessellation, to organize a set of (weighted) points in Rk. Flow shapes are topological spaces corresponding to ...
AUIC
2000
IEEE
15 years 2 months ago
2000
IEEE
Electronic Blocks are a new programming interface, designed for children aged between three and eight years. The Electronic Blocks programming environment includes sensor blocks, ...