148 search results - page 25 / 30 » Formally Analyzing Expected Time Complexity of Algorithms Us... |
COLT
1994
Springer
13 years 11 months ago
1994
Springer
We propose and analyze a distribution learning algorithm for variable memory length Markov processes. These processes can be described by a subclass of probabilistic nite automata...
KDD
2006
ACM
14 years 7 months ago
2006
ACM
Grid systems are proving increasingly useful for managing the batch computing jobs of organizations. One well known example for that is Intel which uses an internally developed sy...
PPOPP
1999
ACM
13 years 11 months ago
1999
ACM
A central problem in executing performance critical parallel and distributed applications on shared networks is the selection of computation nodes and communication paths for exec...
DAC
2003
ACM
14 years 8 months ago
2003
ACM
Verification of system designs continues to be a major challenge today. Simulation remains the primary tool for making sure that implementations perform as they should. We present...
INFOCOM
2010
IEEE
13 years 6 months ago
2010
IEEE
Abstract—We provide a formal model for the Change Management process for Enterprise IT systems, and develop change scheduling algorithms that seek to attain the “change capacit...