Sciweavers

203 search results - page 41 / 41
» An O(nlogn) time algorithm for optimal buffer insertion
Sort
View
FUIN
2006
98views more  FUIN 2006»
13 years 5 months ago
On-line Approximate String Matching in Natural Language
We consider approximate pattern matching in natural language text. We use the words of the text as the alphabet, instead of the characters as in traditional string matching approac...
Kimmo Fredriksson
JCP
2006
139views more  JCP 2006»
13 years 5 months ago
Generalized Sequential Pattern Mining with Item Intervals
Sequential pattern mining is an important data mining method with broad applications that can extract frequent sequences while maintaining their order. However, it is important to ...
Yu Hirate, Hayato Yamana
COR
2007
163views more  COR 2007»
13 years 5 months ago
A general heuristic for vehicle routing problems
We present a unified heuristic, which is able to solve five different variants of the vehicle routing problem: the vehicle routing problem with time windows (VRPTW), the capacit...
David Pisinger, Stefan Ropke