4114 search results - page 21 / 823 » Efficient Algorithms for the 2-Center Problems |
134
click to vote
ESA
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. In the present work, we are interested in the practical behavior of a new fptas to solve the approximation version of the 0-1 multiobjective knapsack problem. Nevertheles...
118
click to vote
JOC
2000
15 years 4 months ago
2000
We present efficient algorithms for computing discrete logarithms in the classgroupofaquadraticorderandforprincipalitytestinginarealquadraticorder,based on the work of D
144
click to vote
AAIM
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. The Longest Common Subsequence (LCS) problem is a classic and well-studied problem in computer science. The LCS problem is a common task in DNA sequence analysis with man...
145
click to vote
IJCSA
2007
15 years 4 months ago
2007
A large number of problems that occur in knowledge-representation, learning, VLSI-design, and other areas of artificial intelligence, are essentially satisfiability problems. The ...
156
click to vote
ACL
2010
15 years 2 months ago
2010
The Viterbi algorithm is the conventional decoding algorithm most widely adopted for sequence labeling. Viterbi decoding is, however, prohibitively slow when the label set is larg...