1749 search results - page 177 / 350 » Logic, Optimization, and Constraint Programming |
SODA
2010
ACM
14 years 5 months ago
2010
ACM
The hypergraph matching problem is to find a largest collection of disjoint hyperedges in a hypergraph. This is a well-studied problem in combinatorial optimization and graph theo...
GECCO
2008
Springer
13 years 9 months ago
2008
Springer
This article introduces our new approach to program representation for genetic programming (GP). We replace the usual s-expression representation scheme by a strongly-typed ion-ba...
LPNMR
2007
Springer
14 years 2 months ago
2007
Springer
We describe a new grounder system for logic programs under answer set semantics, called GrinGo. Our approach combines and extends techniques from the two primary grounding approach...
PEPM
2009
ACM
14 years 5 months ago
2009
ACM
This article introduces a new program transformation in order to enhance the numerical accuracy of floating-point computations. We consider that a program would return an exact r...
GECCO
2008
Springer
13 years 9 months ago
2008
Springer
The choice of an appropriate hardware representation model is key to successful evolution of digital circuits. One of the most popular models is cartesian genetic programming, whi...