Most planning formalisms allow instances with shortest plans of exponential length. While such instances are problematic, they are usually unavoidable and can occur in practice. There are several known cases of restricted planning problems where plans can be exponential but always have a compact (ie. polynomial) representation, often using recursive macros. Such compact representations are impo...

We introduce a model of computation called the Block Move (BM) model. The BM extends the Block Transfer (BT) model of Aggarwal, Chandra, and Snir 1], who studied time complexity under various memory access cost functions ranging from 1 (a) := a to log (a) := dlog 2 ae. We show that up to factors of log t in the total running time t, BMs under 1 are equivalent to multitape Turing machines, and B...

We show new tradeoffs for satisfiability and nondeterministic linear time. Satisfiability cannot be solved on general purpose random-access Turing machines in time n and space n. This improves recent results of Fortnow and of Lipton and Viglas. In general, for any constant a less than the golden ratio, we prove that satisfiability cannot be solved in time n and space n for some positive constan...

Despite the advantages dynamic reconfiguration adds to a system, it only improves system performance if the execution time exceeds the configuration time. As a result, dynamic reconfiguration is only capable of improving the performance of quasi-static applications. In order to improve the performance of dynamic applications, researchers focus on improving the reconfiguration throughput. These ...

Since the HEFT algorithm primarily work on basics of the calculated earliest time in execution from the available resources, it ignores the factors that affect the time in execution of tasks. The proposed algorithm includes multiple new factors for matching right resources for particular task to be scheduled. These factors include inter-node bandwidth between VM nodes, storage, and RAM requirem...