10899 search results - page 709 / 2180 » The GP Programming System |
163
click to vote
ENTCS
2008
15 years 7 months ago
2008
This paper combines two successful techniques from software engineering, aspect-oriented programming and design-by-contract, and applies them in the context of reactive systems. F...
146
click to vote
COR
2006
15 years 7 months ago
2006
We present an algorithm to compute the (pre)-kernel of a TU-game N, v with a system of n 2 1 linear programming problems. In contrast to the algorithms using convergence methods t...
195
click to vote
JSAT
2008
15 years 7 months ago
2008
This paper proposes a new semidefinite programming relaxation for the satisfiability problem. This relaxation is an extension of previous relaxations arising from the paradigm of ...
196
click to vote
ENTCS
2007
15 years 7 months ago
2007
We define a rewrite strategy for a class of non-confluent constructor-based term graph rewriting systems and discuss its correctness. Our strategy and its extension to narrowing...
180
click to vote
SIGPLAN
2008
15 years 7 months ago
2008
Programs encounter increasingly complex and fragile mappings to computing platforms, resulting in performance characteristics that are often mysterious to students, practitioners,...