4112 search results - page 4 / 823 » Efficient Algorithms for the Spoonerism Problem |
CIAC
2000
Springer
15 years 1 months ago
2000
Springer
We present an efficient algorithm for the approximate median selection problem. The algorithm works in-place; it is fast and easy to implement. For a large array it returns, with ...
80
Voted
CSC
2008
14 years 11 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...
76
Voted
CCE
2006
14 years 9 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
14 years 11 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...
CEC
2007
IEEE
15 years 3 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...