Sciweavers

7167 search results - page 269 / 1434
» Answer Set Programming
Sort
View
AOSD
2007
ACM
15 years 6 months ago
Improve pointcut definitions with program views
Aspect-oriented programming languages select join points using pointcut constructs that depend on the syntactic structure of the base program. As the base program evolves, the poi...
Zifu Yang, Tian Zhao
ICALP
2001
Springer
15 years 7 months ago
Combinatorics of Periods in Strings
We consider the set Gn of all period sets of strings of length n over a finite alphabet. We show that there is redundancy in period sets and introduce the notion of an irreducibl...
Eric Rivals, Sven Rahmann
124
Voted
GECCO
2004
Springer
118views Optimization» more  GECCO 2004»
15 years 7 months ago
Adapting Representation in Genetic Programming
Genetic Programming uses trees to represent chromosomes. The user defines the representation space by defining the set of functions and terminals to label the nodes in the trees....
Cezary Z. Janikow
CPAIOR
2006
Springer
15 years 6 months ago
The Power of Semidefinite Programming Relaxations for MAX-SAT
Recently, Linear Programming (LP)-based relaxations have been shown promising in boosting the performance of exact MAX-SAT solvers. We compare Semidefinite Programming (SDP) based ...
Carla P. Gomes, Willem Jan van Hoeve, Lucian Leahu
147
Voted
ICML
2007
IEEE
16 years 3 months ago
Discriminant kernel and regularization parameter learning via semidefinite programming
Regularized Kernel Discriminant Analysis (RKDA) performs linear discriminant analysis in the feature space via the kernel trick. The performance of RKDA depends on the selection o...
Jieping Ye, Jianhui Chen, Shuiwang Ji