4940 search results - page 115 / 988 » On the Complexity of Universal Programs |
143
click to vote
ETS
2000
IEEE
15 years 4 months ago
2000
IEEE
Academic staff development in the pedagogical applications of new technologies is fundamental to the transformation of teaching and learning in tertiary education settings. We pre...
133
click to vote
FOCS
2007
IEEE
15 years 11 months ago
2007
IEEE
We propose a proof-theoretic approach for gaining evidence that certain parameterized problems are not fixedparameter tractable. We consider proofs that witness that a given prop...
158
Voted
TAMC
2009
Springer
15 years 9 months ago
2009
Springer
Given a universal constant k, the multiple Stack Travelling Salesman Problem (kSTSP in short) consists in finding a pickup tour T1 and a delivery tour T2 of n items on two distinc...
174
click to vote
STOC
2000
ACM
15 years 8 months ago
2000
ACM
We first study the problem of doing Verifiable Secret Sharing (VSS) information theoretically secure for a general access structure. We do it in the model where private channels b...
127
click to vote
WOTUG
2007
15 years 5 months ago
2007
Abstract. A fine-grained massively-parallel process-oriented model of platelets (potentially artificial) within a blood vessel is presented. This is a CSP inspired design, expres...