3016 search results - page 287 / 604 » The Online Transportation Problem |
184
click to vote
TCS
2010
15 years 4 months ago
2010
We study the following variant of the bin packing problem. We are given a set of items, where each item has a (non-negative) size and a color. We are also given an integer paramet...
163
click to vote
FOSSACS
2005
Springer
15 years 11 months ago
2005
Springer
Fault diagnosis consists in observing behaviours of systems, and in detecting online whether an error has occurred or not. In the context of discrete event systems this problem has...
172
click to vote
ALT
2010
Springer
15 years 7 months ago
2010
Springer
We consider the problem of inferring the most likely social network given connectivity constraints imposed by observations of outbreaks within the network. Given a set of vertices ...
190
click to vote
GECCO
2008
Springer
15 years 7 months ago
2008
Springer
Probabilistic model building methods can render difficult problems feasible by identifying and exploiting dependencies. They build a probabilistic model from the statistical prope...
152
click to vote
MST
2010
15 years 4 months ago
2010
We study the following variant of the bin covering problem. We are given a set of unit sized items, where each item has a color associated with it. We are given an integer paramet...