9842 search results - page 303 / 1969 » Problem complexity |
198
click to vote
IWPEC
2004
Springer
16 years 4 days ago
2004
Springer
We propose to look at the computational complexity of 2-dimensional geometric optimization problems on a finite point set with respect to the number of inner points (that is, poi...
188
click to vote
GECCO
2003
Springer
16 years 4 hour ago
2003
Springer
We present the result of our work on use of genetic programming for evolving social behavior of agents situated in inherently cooperative environment. We use predators-prey pursuit...
241
click to vote
FSTTCS
1993
Springer
15 years 11 months ago
1993
Springer
We investigate the complexity and approximability of some location problems when two distance values are specified for each pair of potential sites. These problems involve the se...
191
Voted
SPLC
2004
15 years 8 months ago
2004
A fundamental reason for investing in product families is to minimize the application engineering costs. Several organizations that employ product families, however, are becoming i...
129
click to vote
KDD
2010
ACM
15 years 8 months ago
2010
ACM
The fused Lasso penalty enforces sparsity in both the coefficients and their successive differences, which is desirable for applications with features ordered in some meaningful w...