Sciweavers

514 search results - page 44 / 103
» Approximate Periods of Strings
Sort
View
MANSCI
2008
128views more  MANSCI 2008»
13 years 8 months ago
Optimizing Call Center Staffing Using Simulation and Analytic Center Cutting-Plane Methods
We consider the problem of minimizing staffing costs in an inbound call center, while maintaining an acceptable level of service in multiple time periods. The problem is complicat...
Júlíus Atlason, Marina A. Epelman, S...
STOC
2002
ACM
118views Algorithms» more  STOC 2002»
14 years 8 months ago
On the advantage over a random assignment
: We initiate the study of a new measure of approximation. This measure compares the performance of an approximation algorithm to the random assignment algorithm. This is a useful ...
Johan Håstad, Srinivasan Venkatesh
BTW
2009
Springer
145views Database» more  BTW 2009»
14 years 2 months ago
Towards web Supported Identification of Top Affiliations from Scholarly Papers
: Frequent successful publications by specific institutions are indicators for identifying outstanding centres of research. This institution data are present in scholarly papers as...
David Aumüller
IJFCS
2006
87views more  IJFCS 2006»
13 years 8 months ago
Flexible Music Retrieval in Sublinear Time
Music sequences can be treated as texts in order to perform music retrieval tasks on them. However, the text search problems that result from this modeling are unique to music retr...
Kimmo Fredriksson, Veli Mäkinen, Gonzalo Nava...
ISAAC
2003
Springer
133views Algorithms» more  ISAAC 2003»
14 years 1 months ago
The Intractability of Computing the Hamming Distance
Given a string x and a language L, the Hamming distance of x to L is the minimum Hamming distance of x to any string in L. The edit distance of a string to a language is analogous...
Bodo Manthey, Rüdiger Reischuk