2994 search results - page 277 / 599 » Time sequences |
129
click to vote
ICALP
2005
Springer
15 years 10 months ago
2005
Springer
This paper studies the dynamic bin packing problem, in which items arrive and depart at arbitrary time. We want to pack a sequence of unit fractions items (i.e., items with sizes ...
126
click to vote
ISAAC
2004
Springer
15 years 9 months ago
2004
Springer
Given a planar triangulation all of whose faces are initially white, we study the problem of colouring the faces black one by one so that the boundary between black and white faces...
123
click to vote
ISMIR
2004
Springer
15 years 9 months ago
2004
Springer
This paper addresses the problem of the performance evaluation of algorithms for the automatic detection of note onsets in music signals. Our experiments show that creating a data...
145
click to vote
SIGMETRICS
2003
ACM
15 years 9 months ago
2003
ACM
It is common to evaluate scheduling policies based on their mean response times. Another important, but sometimes opposing, performance metric is a scheduling policy’s fairness....
131
click to vote
NETWORKS
2007
15 years 3 months ago
2007
This paper defines an incremental version of the maximum flow problem. In this model, the capacities increase over time and the resulting solution is a sequence of flows that b...