498 search results - page 32 / 100 » A Theory of Complexity for Continuous Time Systems |
PODC
2006
ACM
14 years 1 months ago
2006
ACM
Coloring the nodes of a graph with a small number of colors is one of the most fundamental problems in theoretical computer science. In this paper, we study graph coloring in a di...
SC
2003
ACM
14 years 19 days ago
2003
ACM
We report on a model of the distribution of job submission interarrival times in supercomputers. Interarrival times are modeled as a consequence of a complicated set of decisions ...
PODC
2009
ACM
14 years 8 months ago
2009
ACM
Peer-to-peer systems rely on scalable overlay networks that enable efficient routing between its members. Hypercubic topologies facilitate such operations while each node only nee...
TSMC
2008
13 years 7 months ago
2008
Modeling and predicting of mental workload are among the most important issues in studying human performance in complex systems. Ample research has shown that the amplitude of the ...
SIGMETRICS
2006
ACM
14 years 1 months ago
2006
ACM
Understanding and managing the response time of web services is of key importance as dependence on the World Wide Web continues to grow. We present Remote Latency-based Management...