71228 search results - page 359 / 14246 » Algorithms |
227
click to vote
AAIM
2007
Springer
15 years 11 months ago
2007
Springer
Given an acyclic directed graph and two distinct nodes s and t, we consider the problem of finding k disjoint paths from s to t satisfying some objective. We consider four objectiv...
188
Voted
AAIM
2007
Springer
15 years 11 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...
199
Voted
COCOON
2007
Springer
15 years 11 months ago
2007
Springer
Abstract. We introduce a generic algorithmic technique and apply it on decision and counting versions of graph coloring. Our approach is based on the following idea: either a graph...
178
click to vote
ASIACRYPT
2006
Springer
15 years 11 months ago
2006
Springer
Abstract. To prove or disprove the computational equivalence of solving the RSA problem and factoring integers is a longstanding open problem in cryptography. This paper provides s...
241
click to vote
GECCO
2006
Springer
15 years 11 months ago
2006
Springer
Candlestick analysis, a form of stock market technical analysis, is well suited for use with a genetic search algorithm. This paper explores an implementation of marrying these tw...