393 search results - page 22 / 79 » The LCA Problem Revisited |
113
click to vote
ALGORITHMICA
2010
15 years 2 months ago
2010
We consider the following generalization of bin packing. Each item is associated with a size bounded by 1, as well as a rejection cost, that an algorithm must pay if it chooses not...
114
click to vote
CAI
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. We generalize a learning algorithm originally devised for deterministic all-accepting weighted tree automata (wta) to the setting of arbitrary deterministic wta. The lear...
115
Voted
FORMATS
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. Quantitative model checking computes the probability values of a given property quantifying over all possible schedulers. It turns out that maximum and minimum probabilit...
123
click to vote
WEA
2007
Springer
15 years 8 months ago
2007
Springer
For trunk packing problems only few approximation schemes are known, mostly designed for the European standard DIN 70020 [6] with equally sized boxes [8, 9, 11, 12]. In this paper ...
107
click to vote
ICDCSW
2006
IEEE
15 years 8 months ago
2006
IEEE
Content-based publish/subscribe is a very appealing interaction model that has attracted intense efforts from the research community in the quest to obtain “Internet-wide” sca...