3221 search results - page 7 / 645 » Termination of Linear Programs |
GECCO
2009
Springer
13 years 5 months ago
2009
Springer
We provide an overview of using genetic programming (GP) to model stock returns. Our models employ GP terminals (model decision variables) that are financial factors identified by...
SODA
2001
ACM
13 years 9 months ago
2001
ACM
In the 0-extension problem, we are given a weighted graph with some nodes marked as terminals and a semimetric on the set of terminals. Our goal is to assign the rest of the nodes ...
LISP
2008
13 years 7 months ago
2008
Higher-order logic proof systems combine functional programming with logic, providing functional programmers with a comfortable setting for the formalization of programs, specifica...
AMAST
2010
Springer
13 years 2 months ago
2010
Springer
mu-term is a tool which can be used to verify a number of termination properties of (variants of) Term Rewriting Systems (TRSs): termination of rewriting, termination of innermost ...
POPL
2007
ACM
14 years 8 months ago
2007
ACM
An invariance assertion for a program location is a statement that always holds at during execution of the program. Program invariance analyses infer invariance assertions that ca...