Search Results for author:
Found 2 papers, 0 papers with code
A Smoothing Algorithm for l1 Support Vector Machines
A smoothing algorithm is presented for solving the soft-margin Support Vector Machine (SVM) optimization problem with an $\ell^{1}$ penalty.
gBeam-ACO: a greedy and faster variant of Beam-ACO
Although adding beam search to the ACO heuristic search process is effective, it also increases the amount of work (in terms of partial paths) done by the algorithm at each step.
Cannot find the paper you are looking for? You can
Submit a new open access paper.
