192 search results - page 23 / 39 » Fair Package Assignment |
COMBINATORICS
2006
13 years 8 months ago
2006
It is proved that, if G is a K4-minor-free graph with maximum degree 4, then G is totally ( + 1)-choosable; that is, if every element (vertex or edge) of G is assigned a list of ...
CORR
2004
Springer
13 years 8 months ago
2004
Springer
Fairly rapid environmental changes call for continuous surveillance and on-line decision making. There are two main areas where IT technologies can be valuable. In this paper we pr...
DCOSS
2009
Springer
14 years 3 months ago
2009
Springer
We consider dual classes of geometric coverage problems, in which disks, corresponding to coverage regions of sensors, are used to cover a region or set of points in the plane. The...
TCSV
2010
13 years 3 months ago
2010
We describe a method for achieving perceptually minimal video distortion over packet-erasure networks using perceptually unequal loss protection (PULP). There are two main ingredie...
CE
2008
13 years 8 months ago
2008
Exploring student test, homework, and other assessment scores is a challenge for most teachers, especially when attempting to identify cross-assessment weaknesses and produce fina...