14739 search results - page 145 / 2948 » An optimization problem on the sphere |
GECCO
2004
Springer
15 years 3 months ago
2004
Springer
FOCS
1998
IEEE
15 years 2 months ago
1998
IEEE
We show that approximating the shortest vector problem (in any p norm) to within any constant factor less than p 2 is hard for NP under reverse unfaithful random reductions with i...
ORL
1998
14 years 10 months ago
1998
Good heuristic solutions for large Multisource Weber problems can be obtained by solving related p-median problems in which potential locations of the facilities are users location...
CCS
2007
ACM
15 years 4 months ago
2007
ACM
Researchers have previously looked into the problem of determining if a given set of security hardening measures can effectively make a networked system secure. Many of them also...
121
click to vote
WSC
2008
15 years 25 days ago
2008
We consider a portfolio allocation problem where the objective function is a tail event such as probability of large portfolio losses. The dependence between assets is captured th...