14739 search results - page 80 / 2948 » An optimization problem on the sphere |
PAAPP
1998
14 years 9 months ago
1998
We present optimal parallel algorithms that run in O( pn) time on a pn pn meshconnected computer for a number of fundamental problems concerning proximity and visibility in a simp...
SIAMJO
2010
14 years 4 months ago
2010
We study the problem of minimizing the expected loss of a linear predictor while constraining its sparsity, i.e., bounding the number of features used by the predictor. While the r...
CEC
2007
IEEE
15 years 4 months ago
2007
IEEE
Abstract— This paper presents a comparison of four bioinspired algorithms (all seen as search engines) with a similar constraint-handling mechanism (Deb’s feasibility rules) to...
FCT
2007
Springer
15 years 4 months ago
2007
Springer
We propose and study a new information transmission problem motivated by today’s internet. A real number, perhaps representing control information in a network, is encoded using...
SOFSEM
2007
Springer
15 years 4 months ago
2007
Springer
We study two aspects of a generalization of the Tower of Hanoi puzzle. In 1981, D. Wood suggested its variant, where a bigger disk may be placed higher than a smaller one if their ...