429 search results - page 3 / 86 » How Much Language Is Enough |
CP
2004
Springer
13 years 10 months ago
2004
Springer
Many backtracking algorithms exhibit heavy-tailed distributions, in which their running time is often much longer than their median. We analyze the behavior of two natural variant...
POPL
2008
ACM
14 years 5 months ago
2008
ACM
This pearl develops a statement about parallel prefix computation in the spirit of Knuth's 0-1-Principle for oblivious sorting algorithms. It turns out that 0-1 is not quite ...
PPDP
2004
Springer
13 years 10 months ago
2004
Springer
We introduce just enough tabling (JET), a mechanism to suspend and resume the tabled execution of logic programs at an arbitrary point. In particular, JET allows pruning of tabled...
COMPSAC
2006
IEEE
13 years 11 months ago
2006
IEEE
Even though traceability is legally required in most safety critical software applications and is a recognized component of many software process improvement initiatives, organiza...
EVOW
2011
Springer
12 years 9 months ago
2011
Springer
Abstract. The idea of evolving novel rather than fit solutions has recently been offered as a way to automatically discover the kind of complex solutions that exhibit truly intel...