7311 search results - page 1331 / 1463 » Time in State Machines |
ICALP
2011
Springer
13 years 1 months ago
2011
Springer
In [13], Erd˝os et al. defined the local chromatic number of a graph as the minimum number of colors that must appear within distance 1 of a vertex. For any ∆ ≥ 2, there are ...
ICA3PP
2011
Springer
12 years 9 months ago
2011
Springer
Abstract. Resource provisioning is one of the main challenges in resource sharing environments such as multi-cluster Grids. In these environments each cluster serves requests from ...
AAAI
2012
12 years 17 days ago
2012
Kernel methods have been successfully applied to many machine learning problems. Nevertheless, since the performance of kernel methods depends heavily on the type of kernels being...
DAC
2008
ACM
14 years 11 months ago
2008
ACM
Design-time decisions can often only cover certain scenarios and fail in efficiency when hard-to-predict system scenarios occur. This drives the development of run-time adaptive s...
SAS
2009
Springer
14 years 10 months ago
2009
Springer
Interpretation of FIFO Replacement Daniel Grund and Jan Reineke Saarland University, Saarbr?ucken, Germany In hard real-time systems, the execution time of programs must be bounded...