4112 search results - page 84 / 823 » Efficient Algorithms for the Spoonerism Problem |
121
click to vote
MOR
2002
15 years 3 months ago
2002
ngly better objective function value until an optimal solution is reached. From an abstract point of view, an augmentation problem is solved in each iteration. That is, given a fea...
167
click to vote
CPM
2006
Springer
15 years 7 months ago
2006
Springer
For two strings a, b, the longest common subsequence (LCS) problem consists in comparing a and b by computing the length of their LCS. In a previous paper, we defined a generalisat...
149
click to vote
EVOW
2006
Springer
15 years 7 months ago
2006
Springer
Abstract. We present the newly developed core concept for the Multidimensional Knapsack Problem (MKP) which is an extension of the classical concept for the one-dimensional case. T...
126
click to vote
AMC
2008
15 years 4 months ago
2008
Abstract Nowadays many real problems can be modelled as Constraint Satisfaction Problems (CSPs). A search algorithm for constraint programming requires an order in which variables ...
143
click to vote
CORR
2006
Springer
15 years 4 months ago
2006
Springer
We consider the problem of network coding across multiple unicasts. We give, for wired and wireless networks, efficient polynomial time algorithms for finding optimal network code...