430 search results - page 28 / 86 » Extracting Computer Algebra Programs from Statements |
ICALP
2007
Springer
14 years 1 months ago
2007
Springer
We present algebraic conditions on constraint languages Γ that ensure the hardness of the constraint satisfaction problem CSP(Γ) for complexity classes L, NL, P, NP and ModpL. Th...
ICS
2000
Tsinghua U.
13 years 11 months ago
2000
Tsinghua U.
We present an approach for synthesizing transformations to enhance locality in imperfectly-nested loops. The key idea is to embed the iteration space of every statement in a loop ...
PEPM
2004
ACM
14 years 1 months ago
2004
ACM
Tracing computations is a widely used methodology for program debugging. Lazy languages, in particular, pose new demands on tracing techniques since following the actual trace of ...
FAC
2008
13 years 7 months ago
2008
Abstract. Slicing is a program analysis technique that was originally introduced to improve program debugging and understanding. The purpose of a slicing algorithm is to remove the...
CIMCA
2005
IEEE
14 years 1 months ago
2005
IEEE
We present an approach used in CSDTA (Canonical Sequence Directed Tactics Analyzer) that uses canonical sequences (Joseki) in hoping to improve computer Go programs. We collect 12...