Sciweavers

949 search results - page 53 / 190
» exact 2008
Sort
View
OL
2010
185views more  OL 2010»
14 years 8 months ago
On the Hamming distance in combinatorial optimization problems on hypergraph matchings
In this note we consider the properties of the Hamming distance in combinatorial optimization problems on hypergraph matchings, also known as multidimensional assignment problems....
Alla R. Kammerdiner, Pavlo A. Krokhmal, Panos M. P...
SIAMDM
2010
96views more  SIAMDM 2010»
14 years 8 months ago
Note on Bipartite Graph Tilings
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...
Jan Hladký, Mathias Schacht
DOCENG
2008
ACM
14 years 12 months ago
Configurable editing of XML-based variable-data documents
: 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...
John Lumley, Roger Gimson, Owen Rees
TKDE
2008
169views more  TKDE 2008»
14 years 10 months ago
A Cost-Based Approach to Adaptive Resource Management in Data Stream Systems
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...
Michael Cammert, Jürgen Krämer, Bernhard...
DATE
2008
IEEE
95views Hardware» more  DATE 2008»
15 years 4 months ago
Improvements in Polynomial-Time Feasibility Testing for EDF
This paper presents two fully polynomial-time sufficient feasibility tests for EDF when considering periodic tasks with arbitrary deadlines and preemptive scheduling on uniproces...
Alejandro Masrur, Sebastian Drossler, Georg Farber