8413 search results - page 249 / 1683 » Ordering Problem Subgoals |
119
click to vote
AAIM
2007
Springer
15 years 4 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...
106
click to vote
AIPS
2003
15 years 2 months ago
2003
Despite a number of similarities, vehicle routing problems and scheduling problems are typically solved with different techniques. In this paper, we undertake a systematic study o...
118
Voted
GRC
2008
IEEE
15 years 1 months ago
2008
IEEE
Deceptive problems have been considered difficult for ant colony optimization (ACO) and it was believed that ACO will fail to converge to global optima of deceptive problems. Thi...
AI
2007
Springer
15 years 29 days ago
2007
Springer
We present an efficient algorithm that checks the consistency of partial descriptions of ordered trees. The constraint language of these descriptions was introduced by Cornell in c...
IPMU
2010
Springer
14 years 11 months ago
2010
Springer
A class of extended aggregation operators, called impact functions, is proposed and their basic properties are examined. Some important classes of functions like generalized ordere...