Sciweavers

7988 search results - page 1205 / 1598
» A Useful Undecidable Theory
Sort
View
CCS
2007
ACM
16 years 1 months ago
An algorithm for the appraisal of assurance indicators for complex business processes
In order to provide certified security services we must provide indicators that can measure the level of assurance that a complex business process can offer. Unfortunately the fo...
Fabio Massacci, Artsiom Yautsiukhin
COLT
2007
Springer
16 years 1 months ago
Mitotic Classes
For the natural notion of splitting classes into two disjoint subclasses via a recursive classifier working on texts, the question is addressed how these splittings can look in th...
Sanjay Jain, Frank Stephan
CSEE
2007
Springer
16 years 1 months ago
Creating Meaningful Assessments for Professional Development Education in Software Architecture
Extensive instructional materials have been developed and used for courses in specific software architecture topics offered at the Software Engineering Institute (SEI) at Carnegie...
Elspeth Golden, Len Bass
CSL
2007
Springer
16 years 1 months ago
Unbounded Proof-Length Speed-Up in Deduction Modulo
In 1973, Parikh proved a speed-up theorem conjectured by G¨odel 37 years before: there exist arithmetical formulæ that are provable in first order arithmetic, but whose shorter ...
Guillaume Burel
DNA
2007
Springer
159views Bioinformatics» more  DNA 2007»
16 years 1 months ago
Activatable Tiles: Compact, Robust Programmable Assembly and Other Applications
While algorithmic DNA self-assembly is, in theory, capable of forming complex patterns, its experimental demonstration has been limited by significant assembly errors. In this pa...
Urmi Majumder, Thomas H. LaBean, John H. Reif
« Prev « First page 1205 / 1598 Last » Next »