146 search results - page 5 / 30 » Computably Enumerable Sets and Quasi-Reducibility |
ICPP
2003
IEEE
14 years 1 months ago
2003
IEEE
In this paper we propose an efficient parallel algorithm with simple static and dynamic scheduling for generating combinations. It can use any number of processors (NP ≤ n − ...
CPAIOR
2009
Springer
14 years 3 months ago
2009
Springer
Many real-world problems require the enumeration of all solutions of combinatorial search problems, even though this is often infeasible in practice. However, not always all parts ...
VLSID
2008
IEEE
14 years 9 months ago
2008
IEEE
Today's customizable processors allow the designer to augment the base processor with custom accelerators. By choosing appropriate set of accelerators, designer can significa...
CCS
2006
ACM
14 years 8 days ago
2006
ACM
Role engineering, the task of defining roles and associating permissions to them, is essential to realize the full benefits of the role-based access control paradigm. Essentially,...
MCU
2004
13 years 10 months ago
2004
The classification of discrete dynamical systems that are computationally complete has recently drawn attention in light of Wolfram's "Principle of Computational Equivale...