2661 search results - page 377 / 533 » Quantum Complexity Classes |
125
click to vote
ALT
2001
Springer
16 years 1 months ago
2001
Springer
Abstract. Learning of recursive functions refutably means that for every recursive function, the learning machine has either to learn this function or to refute it, i.e., to signal...
109
Voted
ICCAD
2005
IEEE
16 years 1 months ago
2005
IEEE
State-equivalence based reduction techniques, e.g. bisimulation minimization, can be used to reduce a state transition system to facilitate subsequent verification tasks. However...
132
click to vote
SOSP
2007
ACM
16 years 1 months ago
2007
ACM
We introduce a new reliability infrastructure for file systems called I/O shepherding. I/O shepherding allows a file system developer to craft nuanced reliability policies to de...
141
click to vote
TACAS
2010
Springer
15 years 11 months ago
2010
Springer
Deciding whether a modal formula is satisfiable with respect to a given set of (global) assumptions is a question of fundamental importance in applications of logic in computer sc...
138
click to vote
TACAS
2010
Springer
15 years 11 months ago
2010
Springer
Modern multicore processors, such as the Cell Broadband Engine, achieve high performance by equipping accelerator cores with small “scratchpad” memories. The price for increase...