21 search results - page 3 / 5 » Dynamic Programming to Minimize the Maximum Number of Open S... |
ICALP
2005
Springer
13 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 ...
GPC
2007
Springer
13 years 11 months ago
2007
Springer
This paper focuses on two problems related to QoS-aware I/O server placement in hierarchical Grid environments. Given a hierarchical network with requests from clients, the network...
MFCS
2009
Springer
13 years 12 months ago
2009
Springer
The longest path problem is the problem of finding a path of maximum length in a graph. Polynomial solutions for this problem are known only for small classes of graphs, while it ...
DATE
2007
IEEE
13 years 11 months ago
2007
IEEE
Modern systems-on-a-chip platforms support multiple clock domains, in which different sub-circuits are driven by different clock signals. Although the frequency of each domain can...
ISBRA
2009
Springer
14 years 3 days ago
2009
Springer
A tanglegram is a pair of trees on the same set of leaves with matching leaves in the two trees joined by an edge. Tanglegrams are widely used in biology – to compare evolutiona...