Sciweavers

1160 search results - page 29 / 232
» Revisiting the Sequence Constraint
Sort
View
CORR
2008
Springer
95views Education» more  CORR 2008»
15 years 2 months ago
Depth as Randomness Deficiency
Depth of an object concerns a tradeoff between computation time and excess of program length over the shortest program length required to obtain the object. It gives an unconditio...
Luis Antunes 0002, Armando Matos, Andre Souto, Pau...
SAC
2004
ACM
15 years 7 months ago
A new algorithm for gap constrained sequence mining
The sequence mining problem consists in finding frequent sequential patterns in a database of time-stamped events. Several application domains require limiting the maximum tempor...
Salvatore Orlando, Raffaele Perego, Claudio Silves...
EOR
2008
75views more  EOR 2008»
15 years 2 months ago
Soft car sequencing with colors: Lower bounds and optimality proofs
This paper is a study of the car sequencing problem, when feature spacing constraints are soft and colors of vehicles are taken into account. Both pseudo-polynomial algorithms and ...
Thierry Benoist
DAWAK
2005
Springer
15 years 7 months ago
Optimizing a Sequence of Frequent Pattern Queries
Discovery of frequent patterns is a very important data mining problem with numerous applications. Frequent pattern mining is often regarded as advanced querying where a user speci...
Mikolaj Morzy, Marek Wojciechowski, Maciej Zakrzew...
SCHEDULING
2008
85views more  SCHEDULING 2008»
15 years 1 months ago
A dynamic programming algorithm for days-off scheduling with sequence dependent labor costs
This paper presents a dynamic programming (DP) algorithm for solving a labor scheduling problem with several realistic days-off scheduling constraints and a cost structure that dep...
Moustafa Elshafei, Hesham K. Alfares