4940 search results - page 197 / 988 » On the Complexity of Universal Programs |
172
click to vote
TARK
2005
Springer
15 years 11 months ago
2005
Springer
s for Multi-Agent Only Knowing (extended abstract) Arild Waaler1,2 and Bjørnar Solhaug3,4 1 Finnmark College, Norway 2 Dep. of Informatics, University of Oslo, Norway 3 SINTEF ICT...
144
click to vote
TAMC
2010
Springer
15 years 11 months ago
2010
Springer
Unless we resolve the P vs NP question, we are unable to say whether there is an algorithm (acceptor) that accepts Boolean tautologies in polynomial time and does not accept non-ta...
143
click to vote
ADC
2000
Springer
15 years 10 months ago
2000
Springer
Annotated speech corpora are databases consisting of signal data along with time-aligned symbolic ‘transcriptions’. Such databases are typically multidimensional, heterogeneou...
155
click to vote
PATAT
1997
Springer
15 years 10 months ago
1997
Springer
In this study we have tackled the NP-hard problem of academic class scheduling (or timetabling) at the university level. We have investigated a variety of approaches based on simu...
148
click to vote
ECTEL
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. Nowadays, engineering studies are characterized by high mobility of students, lecturers and workforce and by the dynamics of multinational companies where "classes&q...