4114 search results - page 8 / 823 » Efficient Algorithms for the 2-Center Problems |
CSC
2008
15 years 1 months ago
2008
- The set-covering problem is an interesting problem in computational complexity theory. In [1], the setcovering problem has been proved to be NP hard and a greedy heuristic algori...
CCE
2006
14 years 11 months ago
2006
The class of stochastic nonlinear programming (SNLP) problems is important in optimization due to the presence of nonlinearity and uncertainty in many applications, including thos...
KDD
2010
ACM
15 years 1 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...
99
Voted
CEC
2007
IEEE
15 years 6 months ago
2007
IEEE
—Genetic Algorithms (GAs) have a good potential of solving the Gate Assignment Problem (GAP) at airport terminals, and the design of feasible and efficient evolutionary operators...
CORR
2008
Springer
14 years 11 months ago
2008
Springer
: In this paper I present several novel, efficient, algorithmic techniques for solving some multidimensional geometric data management and analysis problems. The techniques are bas...