4940 search results - page 946 / 988 » On the Complexity of Universal Programs |
PDP
2007
IEEE
14 years 4 months ago
2007
IEEE
Scientific and engineering programming has been around since the beginning of computing, often being the driving force for new system development and innovation. At the same time...
TPHOL
2007
IEEE
14 years 4 months ago
2007
IEEE
Formal, modular, and mechanized verification of realistic systems code is desirable but challenging. Verification of machine context management (a basis of multi-tasking) is one ...
CP
2007
Springer
14 years 4 months ago
2007
Springer
Searching for optimal solutions to a problem using lower bounds obtained from a relaxation is a common idea in Heuristic Search and Planning. In SAT and CSPs, however, explicit rel...
FC
2007
Springer
14 years 4 months ago
2007
Springer
1 2 There is a critical need in computer security to communicate risks and thereby enable informed decisions by naive users. Yet computer security has not been engaged with the sc...
ISSAC
2007
Springer
14 years 4 months ago
2007
Springer
We discuss the parallelization of algorithms for solving polynomial systems symbolically by way of triangular decompositions. We introduce a component-level parallelism for which ...