Sciweavers

1725 search results - page 17 / 345
» Relaxed genetic programming
Sort
View
GECCO
2006
Springer
144views Optimization» more  GECCO 2006»
13 years 11 months ago
When lisp is faster than C
This paper compares the performance of the program evaluation phase of genetic programming using C and Common Lisp. A simple experiment is conducted, and the conclusion is that ge...
Børge Svingen
GECCO
2006
Springer
150views Optimization» more  GECCO 2006»
13 years 11 months ago
Evaluation relaxation using substructural information and linear estimation
The paper presents an evaluation-relaxation scheme where a fitness surrogate automatically adapts to the problem structure and the partial contributions of subsolutions to the fit...
Kumara Sastry, Cláudio F. Lima, David E. Go...
CPAIOR
2011
Springer
12 years 11 months ago
Manipulating MDD Relaxations for Combinatorial Optimization
Abstract. We study the application of limited-width MDDs (multivalued decision diagrams) as discrete relaxations for combinatorial optimization problems. These relaxations are used...
David Bergman, Willem Jan van Hoeve, John N. Hooke...
POPL
2005
ACM
14 years 8 months ago
Downgrading policies and relaxed noninterference
In traditional information-flow type systems, the security policy is often formalized as noninterference properties. However, noninterference alone is too strong to express securi...
Peng Li, Steve Zdancewic
JMLR
2006
124views more  JMLR 2006»
13 years 7 months ago
Fast SDP Relaxations of Graph Cut Clustering, Transduction, and Other Combinatorial Problem
The rise of convex programming has changed the face of many research fields in recent years, machine learning being one of the ones that benefitted the most. A very recent develop...
Tijl De Bie, Nello Cristianini