994 search results - page 56 / 199 » Custom Computing Machines for the Set Covering Problem |
183
Voted
ICTAC
2004
Springer
15 years 12 months ago
2004
Springer
Abstract. P systems (known also as membrane systems) are biologically motivated theoretical models of distributed and parallel computing. The two most interesting questions in the ...
184
click to vote
SAMOS
2004
Springer
15 years 12 months ago
2004
Springer
— In this paper we present the Molen programming paradigm, which is a sequential consistency paradigm for programming Custom Computing Machines (CCM). The programming paradigm al...
190
click to vote
MSCS
2010
15 years 5 months ago
2010
ABSTRACT. In this note we prove that any Turing machine which uses only a finite computational space for every input cannot solve an uncomputable problem even in case it runs in a...
196
click to vote
APSEC
2001
IEEE
15 years 10 months ago
2001
IEEE
Word processing software, email, and spreadsheet have revolutionized office activities. There are many other office tasks that are amenable to automation, such as: scheduling a vi...
197
click to vote
CVPR
2011
IEEE
14 years 10 months ago
2011
IEEE
In this paper we address the two-class classification problem within the tensor-based framework, by formulating the Support Tucker Machines (STuMs). More precisely, in the propos...