Sciweavers

632 search results - page 58 / 127
» Proving Invariants of Functional Programs
Sort
View
GECCO
2010
Springer
218views Optimization» more  GECCO 2010»
15 years 4 months ago
Cartesian genetic programming
This paper presents a new form of Genetic Programming called Cartesian Genetic Programming in which a program is represented as an indexed graph. The graph is encoded in the form o...
Julian Francis Miller, Simon L. Harding
PAMI
2007
176views more  PAMI 2007»
15 years 2 days ago
Approximate Labeling via Graph Cuts Based on Linear Programming
A new framework is presented for both understanding and developing graph-cut based combinatorial algorithms suitable for the approximate optimization of a very wide class of MRFs ...
Nikos Komodakis, Georgios Tziritas
90
Voted
TACAS
2009
Springer
136views Algorithms» more  TACAS 2009»
15 years 7 months ago
Path Feasibility Analysis for String-Manipulating Programs
We discuss the problem of path feasibility for programs manipulating strings using a collection of standard string library functions. We prove results on the complexity of this pro...
Nikolaj Bjørner, Nikolai Tillmann, Andrei V...
206
Voted
POPL
2009
ACM
16 years 1 months ago
Masked types for sound object initialization
This paper presents a type-based solution to the long-standing problem of object initialization. Constructors, the conventional mechanism for object initialization, have semantics...
Xin Qi, Andrew C. Myers
89
Voted
AML
2007
77views more  AML 2007»
15 years 22 days ago
Complex analysis in subsystems of second order arithmetic
Abstract. This research is motivated by the program of Reverse Mathematics. We investigate basic part of complex analysis within some weak subsystems of second order arithmetic, in...
Keita Yokoyama