1204 search results - page 83 / 241 » Termination of Polynomial Programs |
106
click to vote
PPDP
2009
Springer
15 years 7 months ago
2009
Springer
Traversal strategies are at the heart of transformational programming with rewriting-based frameworks such as Stratego/XT or Tom and specific approaches for generic functional pr...
79
Voted
MP
2006
15 years 18 days ago
2006
Consider a 0/1 integer program min{cT x : Ax b, x {0, 1}n } where A is nonnegative. We show that if the number of minimal covers of Ax b is polynomially bounded, then there is ...
142
click to vote
AAAI
2008
15 years 1 months ago
2008
In this poster we describe the tabling techniques for Sequential and Concurrent Horn Transaction Logic. Horn Transaction Logic is an extension of classical logic programming with ...
160
click to vote
PSSE
2004
Springer
15 years 6 months ago
2004
Springer
“demonic” nondeterminism, representing abstraction from (or ignorance of) which of two program fragments will be executed. By introducing probabilistic nondeterminism into GCL,...
102
Voted
GECCO
2008
Springer
15 years 1 months ago
2008
Springer
This paper begins by reviewing different methods of automatic programming while emphasizing the technique of Ant Programming (AP). AP uses an ant foraging metaphor in which ants g...