1421 search results - page 175 / 285 » Algorithms for subsequence combinatorics |
128
Voted
HUC
2009
Springer
15 years 9 months ago
2009
Springer
Detecting visits to semantically meaningful places is important for many emerging mobile applications. We present PlaceSense, a place discovery algorithm suitable for mobile devic...
140
click to vote
CP
2001
Springer
15 years 9 months ago
2001
Springer
Abstract. Computing lower bounds to the best-cost extension of a tuple is an ubiquous task in constraint optimization. A particular case of special interest is the computation of l...
128
click to vote
CP
1998
Springer
15 years 8 months ago
1998
Springer
A well-studied problem in the electric power industry is that of optimally scheduling preventative maintenance of power generating units within a power plant. We show how these pr...
123
click to vote
SIGMOD
1994
ACM
15 years 8 months ago
1994
ACM
We describe an algorithm for estimating the number of page fetches for a partial or complete scan of a B-tree index. The algorithm obtains estimates for the number of page fetches ...
132
click to vote
AAIM
2010
Springer
15 years 8 months ago
2010
Springer
Abstract. This paper presents an iterative, highly parallelizable approach to find good tours for very large instances of the Euclidian version of the well-known Traveling Salesma...