1920 search results - page 35 / 384 » The Complexity of the A B C Problem |
173
click to vote
CSJM
2006
15 years 5 months ago
2006
Traveling Salesman Problem (TSP) is a generic name that includes diverse practical models. Motivated by applications, a new model of TSP is examined -- a synthesis of classical TS...
189
click to vote
CAI
2010
Springer
15 years 3 months ago
2010
Springer
The problem of finding a constrained longest common subsequence (CLCS) for the sequences A and B with respect to the sequence P was introduced recently. Its goal is to find a longe...
142
click to vote
ANOR
2007
15 years 6 months ago
2007
We present a new implementation of a widely used swap-based local search procedure for the p-median problem, proposed in 1968 by Teitz and Bart. Our method produces the same outpu...
162
click to vote
IJCGA
2006
15 years 5 months ago
2006
We obtain lower bounds in the algebraic computation tree model for deciding the separability of two disjoint point sets. In particular, we show (n log n) time lower bounds for sep...
225
click to vote
CORR
2012
Springer
14 years 1 months ago
2012
Springer
Reinforcement learning addresses the dilemma between exploration to find profitable actions and exploitation to act according to the best observations already made. Bandit proble...