4110 search results - page 50 / 822 » Efficient algorithms for the 2-gathering problem |
131
Voted
JCST
2008
15 years 3 months ago
2008
Research into ant colony algorithms for solving continuous optimization problems forms one of the most significant and promising areas in swarm computation. Although traditional an...
125
Voted
NETWORKS
2008
15 years 3 months ago
2008
Recently published research indicates that a vertex-labeling algorithm based on dynamic-programming concepts is the most efficient procedure available for solving constrained shor...
106
Voted
JMLR
2006
15 years 3 months ago
2006
We propose an active set algorithm to solve the convex quadratic programming (QP) problem which is the core of the support vector machine (SVM) training. The underlying method is ...
123
Voted
KES
2005
Springer
15 years 9 months ago
2005
Springer
The new market forces have affected the operation of distribution centers (DCs) extremely. The DCs demand an increased productivity and a low cost in their daily operation. This pa...
119
Voted
ICCAD
1996
IEEE
15 years 7 months ago
1996
IEEE
In this paper, we study the simultaneous transistor and interconnect sizing (STIS) problem. We de ne a class of optimization problems as CH-posynomial programs and reveal a genera...