4757 search results - page 162 / 952 » Monads for Functional Programming |
168
click to vote
TACAS
2010
Springer
16 years 1 months ago
2010
Springer
Ranking function synthesis is a key aspect to the success of modern termination provers for imperative programs. While it is wellknown how to generate linear ranking functions for ...
196
click to vote
WCRE
1999
IEEE
15 years 10 months ago
1999
IEEE
We present a technique for restructuring functions with low cohesion into functions with high cohesion. Such restructuring is desirable when re-architecting a legacy system into a...
176
click to vote
GECCO
2000
Springer
15 years 10 months ago
2000
Springer
We describe the use of grammars as an approach to automatic function definition in Grammatical Evolution. The automatic generation of functions allows the evolution of both the fu...
192
click to vote
CONSTRAINTS
2008
15 years 6 months ago
2008
Submodular function minimization is a polynomially-solvable combinatorial problem. Unfortunately the best known general-purpose algorithms have high-order polynomial time complexi...
151
click to vote
ANSS
2006
IEEE
16 years 14 days ago
2006
IEEE
Programs often call the same function with the same arguments, yielding the same results. We call this phenomenon, “function reuse”. Previously, we have shown such a behavior ...