147 search results - page 6 / 30 » The Uncapacitated Swapping Problem |
WINE
2007
Springer
14 years 3 months ago
2007
Springer
We revisit the problem of incentive-compatible interdomain routing, examining the, quite realistic, special case in which the autonomous systems’ (ASes’) utilities are linear f...
BIRD
2008
Springer
13 years 11 months ago
2008
Springer
The swap matching problem consists if finding a pattern in a text, while allowing for transpositions in the pattern. A new approach using a graph-theoretic model was presented in [...
SWAP
2008
13 years 11 months ago
2008
The definition of new concepts or roles for which extensional knowledge become available can turn out to be necessary to make a DL ontology evolve. In this paper we reformulate thi...
ICPADS
2000
IEEE
14 years 2 months ago
2000
IEEE
Many nonblocking algorithms have been proposed for shared queues. Previous studies indicate that link-based algorithms perform best. However, these algorithms have a memory manage...
ICNC
2005
Springer
14 years 3 months ago
2005
Springer
Abstract. Four local search algorithms are investigated for the phylogenetic tree reconstruction problem under the Maximum Parsimony criterion. A new subtree swapping neighborhood ...