4940 search results - page 26 / 988 » On the Complexity of Universal Programs |
136
click to vote
ISSTA
2012
ACM
13 years 4 months ago
2012
ACM
Recent research has suggested that a large class of software bugs fall into the category of inconsistencies, or cases where two pieces of program code make incompatible assumption...
MP
2007
15 years 1 months ago
2007
Given a primal-dual pair of linear programs, it is well known that if their optimal values are viewed as lying on the extended real line, then the duality gap is zero, unless both...
106
click to vote
EVOW
2009
Springer
15 years 8 months ago
2009
Springer
Abstract. This paper describes the application of a hybrid genetic algorithm to a real-world instance of the university course timetabling problem. We address the timetabling of la...
136
click to vote
LICS
2010
IEEE
14 years 11 months ago
2010
IEEE
The universal-algebraic approach has proved a powerful tool in the study of the computational complexity of constraint satisfaction problems (CSPs). This approach has previously b...
140
Voted
JOC
2011
14 years 8 months ago
2011
In light of the growing complexity of cryptographic protocols and applications, it becomes highly desirable to mechanize — and eventually automate — the security analysis of p...