Since the work by Osher and Sethian on level-sets algorithms for numerical shape evolutions, this technique has been used for a large number of applications in numerous fields. In...
This paper describes two algorithms for the compression of propositional resolution proofs. The first algorithm, RecyclePivotsWithIntersection, performs partial regularization, re...
Pascal Fontaine, Stephan Merz, Bruno Woltzenlogel ...
The performance of a dynamic optimization system depends heavily on the code it selects to optimize. Many current systems follow the design of HP Dynamo and select a single interp...
Given an algorithm A for solving some mathematical problem based on the iterative solution of simpler subproblems, an Outer Trust-Region (OTR) modification of A is the result of ...
Ernesto G. Birgin, Emerson V. Castelani, Andr&eacu...
Constraint-based analysis is a technique for inferring implementation types. Traditionally it has been described using mathematical formalisms. We explain it in a different and mor...