Results 1  10
of
411,917
A TimeSpace Tradeoff for Sorting on NonOblivious Machines
, 1981
"... This paper adopts the latter strategy in order to pursue the complexity of sorting ..."
Abstract

Cited by 31 (2 self)
 Add to MetaCart
This paper adopts the latter strategy in order to pursue the complexity of sorting
A TIMESPACE TRADEOFF FOR SORTING ON NONOBLIVIOUS MACHINES*
"... A model of computation is introduced which permits the analysis of both the time and space requirements of nonoblivious programs. Using this model, it is demonstrated that any algorithm for sorting n inputs which is based on comparisons of individual inputs requires timespace product proportion ..."
Abstract
 Add to MetaCart
A model of computation is introduced which permits the analysis of both the time and space requirements of nonoblivious programs. Using this model, it is demonstrated that any algorithm for sorting n inputs which is based on comparisons of individual inputs requires timespace product propor
A timespace tradeoff for element distinctness
 SIAM Journal on Computing
, 1987
"... Abstract. In A time space tradeoff for sorting on nonoblivious machines, Borodin et al. [J. Comput. System Sci., 22 (1981), pp. 351364] proved that to sort n elements requires TS =fl(n 2) where T=time and S space on a comparison based branching program. Although element distinctness and sorting ar ..."
Abstract

Cited by 18 (0 self)
 Add to MetaCart
Abstract. In A time space tradeoff for sorting on nonoblivious machines, Borodin et al. [J. Comput. System Sci., 22 (1981), pp. 351364] proved that to sort n elements requires TS =fl(n 2) where T=time and S space on a comparison based branching program. Although element distinctness and sorting
Space/Time Tradeoffs in Hash Coding with Allowable Errors
 Communications of the ACM
, 1970
"... this paper tradeoffs among certain computational factors in hash coding are analyzed. The paradigm problem considered is that of testing a series of messages onebyone for membership in a given set of messages. Two new hash coding methods are examined and compared with a particular conventional h ..."
Abstract

Cited by 2067 (0 self)
 Add to MetaCart
hashcoding method. The computational factors considered are the size of the hash area (space), the time required to identify a message as a nonmember of the given set (reject time), and an allowable error frequency
TimeSpace Tradeoffs Abstract
"... We introduce branching programs augmented with the ability to write to and read from variables other than the inputs. This is a substantial strengthening of the model. We show, however, that Ajtai’s size lower bounds for lineartime multiway branching programs solving a Hamming distance problem [Aj ..."
Abstract
 Add to MetaCart
[Ajt99a] carry over to the stronger model. This indicates an obstacle to extending this and related results to a general T S = Ω(n 2) tradeoff for running times T above n log n, yet also indicates “slack ” in these results that might be exploited for better lower bounds in the original model. We also
Optimal TimeSpace TradeOffs for Sorting
 IN PROC. 39TH IEEE SYMPOS. FOUND. COMPUT. SCI
, 1998
"... We study the fundamental problem of sorting in a sequential model of computation and in particular consider the timespace tradeoff (product of time and space) for this problem. Beame has ..."
Abstract

Cited by 14 (0 self)
 Add to MetaCart
We study the fundamental problem of sorting in a sequential model of computation and in particular consider the timespace tradeoff (product of time and space) for this problem. Beame has
Live Migration of Virtual Machines
 In Proceedings of the 2nd ACM/USENIX Symposium on Networked Systems Design and Implementation (NSDI
, 2005
"... Migrating operating system instances across distinct physical hosts is a useful tool for administrators of data centers and clusters: It allows a clean separation between hardware and software, and facilitates fault management, load balancing, and lowlevel system maintenance. By carrying out the ma ..."
Abstract

Cited by 613 (14 self)
 Add to MetaCart
Migrating operating system instances across distinct physical hosts is a useful tool for administrators of data centers and clusters: It allows a clean separation between hardware and software, and facilitates fault management, load balancing, and lowlevel system maintenance. By carrying out
A learning algorithm for Boltzmann machines
 Cognitive Science
, 1985
"... The computotionol power of massively parallel networks of simple processing elements resides in the communication bandwidth provided by the hardware connections between elements. These connections con allow a significant fraction of the knowledge of the system to be applied to an instance of a probl ..."
Abstract

Cited by 586 (13 self)
 Add to MetaCart
problem in o very short time. One kind of computation for which massively porollel networks appear to be well suited is large constraint satisfaction searches, but to use the connections efficiently two conditions must be met: First, a search technique that is suitable for parallel networks must be found
Multiobjective Optimization Using Nondominated Sorting in Genetic Algorithms
 Evolutionary Computation
, 1994
"... In trying to solve multiobjective optimization problems, many traditional methods scalarize the objective vector into a single objective. In those cases, the obtained solution is highly sensitive to the weight vector used in the scalarization process and demands the user to have knowledge about t ..."
Abstract

Cited by 524 (4 self)
 Add to MetaCart
sorting in GAs along with a niche and speciation method to find multiple Paretooptimal points sim...
1 Optimal TimeSpace TradeOffs for Sorting
"... Abstract We study the fundamental problem of sorting in a sequential model of computation and in particular consider the timespace tradeoff (product of time and space) for thisproblem. Beame has shown a lower bound of \Omega (n2) for this product leaving a gap of a logarithmic factor up to the p ..."
Abstract
 Add to MetaCart
Abstract We study the fundamental problem of sorting in a sequential model of computation and in particular consider the timespace tradeoff (product of time and space) for thisproblem. Beame has shown a lower bound of \Omega (n2) for this product leaving a gap of a logarithmic factor up
Results 1  10
of
411,917