14548 search results - page 301 / 2910 » The Optimal Path-Matching Problem |
161
click to vote
CPM
1999
Springer
15 years 11 months ago
1999
Springer
We focus on the combinatorial analysis of physical mapping with repeated probes. We present computational complexity results, and we describe and analyze an algorithmic strategy. W...
202
click to vote
WADS
2007
Springer
16 years 22 days ago
2007
Springer
The stable marriage problem is a classical matching problem introduced by Gale and Shapley. It is known that for any instance, there exists a solution, and there is a polynomial ti...
154
click to vote
COCOON
1998
Springer
15 years 11 months ago
1998
Springer
In this paper, we generalize the Ski-Rental Problem to the Bahncard Problem which is an online problem of practical relevance for all travelers. The Bahncard is a railway pass of t...
183
click to vote
FLAIRS
2006
15 years 8 months ago
2006
There exist a number of algorithms that can solve dynamic constraint satisfaction/optimization problems (DynCSPs or DynCOPs). Because of the large variety in the characteristics o...
159
click to vote
MOR
2002
15 years 6 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...