400 search results - page 44 / 80 » What Makes a Problem GP-Hard |
123
click to vote
CCS
2000
ACM
15 years 8 months ago
2000
ACM
The Internet provides an environment where two parties, who are virtually strangers to each other, can make connections and do business together. Before any actual business starts...
164
click to vote
GECCO
2009
Springer
15 years 11 months ago
2009
Springer
We revisit the roots of Genetic Programming (i.e. Natural Evolution), and conclude that the mechanisms of the process of evolution (i.e. selection, inheritance and variation) are ...
147
click to vote
KDD
2004
ACM
16 years 4 months ago
2004
ACM
This paper describes a prototype that predicts the shopping lists for customers in a retail store. The shopping list prediction is one aspect of a larger system we have developed ...
150
click to vote
ICDM
2007
IEEE
15 years 10 months ago
2007
IEEE
We present an extension to the Lasso [9] for binary classification problems with ordered attributes. Inspired by the Fused Lasso [8] and the Group Lasso [10, 4] models, we aim to...
121
click to vote
CRYPTO
2006
Springer
15 years 8 months ago
2006
Springer
Abstract Lattice reduction is a hard problem of interest to both publickey cryptography and cryptanalysis. Despite its importance, extremely few algorithms are known. The best algo...