109 search results - page 14 / 22 » Extensions: A Technique for Structuring Functional-Logic Pro... |
IPCO
2008
13 years 8 months ago
2008
Abstract. Semidefinite relaxations are known to deliver good approximations for combinatorial optimization problems like graph bisection. Using the spectral bundle method it is pos...
ENTCS
2006
13 years 7 months ago
2006
Scannerless generalized parsing techniques allow parsers to be derived directly from unified, declarative specifications. Unfortunately, in order to uniquely parse existing progra...
CGO
2011
IEEE
12 years 11 months ago
2011
IEEE
—Approximating ideal program outputs is a common technique for solving computationally difficult problems, for adhering to processing or timing constraints, and for performance ...
ECOOP
2007
Springer
14 years 1 months ago
2007
Springer
We present MJ: a language for specifying general classes whose members are produced by iterating over members of other classes. We call this technique “class morphing” or just ...
LOPSTR
2001
Springer
13 years 11 months ago
2001
Springer
Abstract. Deforestation is a well-known program transformation technique which eliminates intermediate data structures that are passed between functions. One of its weaknesses is t...