Sciweavers

2861 search results - page 223 / 573
» Constraint Programming
Sort
View
GECCO
2004
Springer
116views Optimization» more  GECCO 2004»
15 years 12 months ago
Using Genetic Programming to Obtain a Closed-Form Approximation to a Recursive Function
Abstract. We demonstrate a fully automated method for obtaining a closedform approximation of a recursive function. This method resulted from a realworld problem in which we had a ...
Evan Kirshenbaum, Henri Jacques Suermondt
SAS
2004
Springer
103views Formal Methods» more  SAS 2004»
15 years 11 months ago
A Scalable Nonuniform Pointer Analysis for Embedded Programs
Abstract. In this paper we present a scalable pointer analysis for embedded applications that is able to distinguish between instances of recursively defined data structures and e...
Arnaud Venet
ALP
1994
Springer
15 years 10 months ago
Compositional Analysis for Equational Horn Programs
Abstract. We introduce a compositional characterization of the operational semantics of equational Horn programs. Then we show that this semantics and the standard operational sema...
María Alpuente, Moreno Falaschi, Germ&aacut...
ASAP
1997
IEEE
144views Hardware» more  ASAP 1997»
15 years 10 months ago
Automatic data mapping of signal processing applications
This paper presents a technique to map automatically a complete digital signal processing (DSP) application onto a parallel machine with distributed memory. Unlike other applicati...
Corinne Ancourt, Denis Barthou, Christophe Guettie...
ICPR
2008
IEEE
16 years 7 months ago
Image segmentation by convex quadratic programming
A quadratic programming formulation for multiclass image segmentation is investigated. It is proved that, in the convex case, the non-negativity constraint on the recent reported ...
Mariano Rivera, Oscar Dalmau Cedeño, Josue ...