Sciweavers

4940 search results - page 39 / 988
» On the Complexity of Universal Programs
Sort
View
ECTEL
2006
Springer
15 years 5 months ago
Is There a Way to e-Bologna? Cross-National Collaborative Activities in University Courses
This article describes a study of distance collaborative activities that have been conducted in a cross-national setting between a Greek and a German university. We discuss issues ...
Andreas Harrer, Georgios Kahrimanis, Sam Zeini, La...
PATAT
1995
Springer
122views Education» more  PATAT 1995»
15 years 5 months ago
A Memetic Algorithm for University Exam Timetabling
The scheduling of exams in institutions of higher education is known to be a highly constrained problem. The advent of modularity in many institutions in the UK has resulted in a s...
Edmund K. Burke, James P. Newall, Rupert F. Weare
AAAI
2006
15 years 3 months ago
Towards Chemical Universal Turing Machines
Present developments in the natural sciences are providing enormous and challenging opportunities for various AI technologies to have an unprecedented impact in the broader scient...
Stephen Muggleton
ICALP
2007
Springer
15 years 3 months ago
Trading Static for Adaptive Security in Universally Composable Zero-Knowledge
Adaptive security, while more realistic as an adversarial model, is typically much harder to achieve compared to static security in cryptographic protocol design. Universal composi...
Aggelos Kiayias, Hong-Sheng Zhou
PLDI
2009
ACM
16 years 2 months ago
Program verification using templates over predicate abstraction
dicate Abstraction Saurabh Srivastava University of Maryland, College Park Sumit Gulwani Microsoft Research, Redmond
Saurabh Srivastava, Sumit Gulwani