4940 search results - page 240 / 988 » On the Complexity of Universal Programs |
174
click to vote
DSL
2009
15 years 4 months ago
2009
Programmers often write custom parsers for the command line input of their programs. They do so, in part, because they believe that both their program's parameterization and t...
205
click to vote
ISSEP
2010
Springer
16 years 3 months ago
2010
Springer
Teaching introductory object-oriented programming presents considerable challenges. Some of these challenges are due to the intrinsic complexity of the subject matter — object-or...
203
click to vote
ASP
2005
Springer
16 years 2 days ago
2005
Springer
A new exact algorithm for computing answer sets of logic programs is presented and analyzed. The algorithm takes a logic program in Kernel normal form as an input and computes its ...
163
click to vote
COCOA
2007
Springer
16 years 21 days ago
2007
Springer
We define a fundamental domain for a linear programming relaxation of a combinatorial integer program which is symmetric under a group action. We then describe a straightforward w...
137
click to vote
SOFTVIS
2005
ACM
16 years 3 days ago
2005
ACM
Programming in parallel is an error-prone and complex task compounded by the lack of tool support for both programming and debugging. Recent advances in compiler-directed shared m...