949 search results - page 53 / 190 » exact 2008 |
111
Voted
OL
2010
14 years 11 months ago
2010
In this note we consider the properties of the Hamming distance in combinatorial optimization problems on hypergraph matchings, also known as multidimensional assignment problems....
118
click to vote
SIAMDM
2010
14 years 11 months ago
2010
Let s < t be two fixed positive integers. We study what are the minimum degree conditions for a bipartite graph G, with both color classes of size n = k(s + t), which ensure t...
95
Voted
DOCENG
2008
ACM
15 years 2 months ago
2008
ACM
: Variable data documents can be considered as functions of their bindings to values, and this function could be arbitrarily complex to build strongly-customised but high-value doc...
135
Voted
TKDE
2008
15 years 13 days ago
2008
Data stream management systems need to control their resources adaptively since stream characteristics and query workload may vary over time. In this paper we investigate an approa...
71
Voted
DATE
2008
IEEE
15 years 7 months ago
2008
IEEE
This paper presents two fully polynomial-time sufficient feasibility tests for EDF when considering periodic tasks with arbitrary deadlines and preemptive scheduling on uniproces...