Results 1  10
of
718,088
Toward an instance theory of automatization
 Psychological Review
, 1988
"... This article presents a theory in which automatization is construed as the acquisition of a domainspecific knowledge base, formed of separate representations, instances, of each exposure to the task. Processing is considered automatic if it relies on retrieval of stored instances, which will occur ..."
Abstract

Cited by 619 (38 self)
 Add to MetaCart
only after practice in a consistent environment. Practice is important because it increases the amount retrieved and the speed of retrieval; consistency is important because it ensures that the retrieved instances will be useful. The theory accounts quantitatively for the powerfunction speedup
SpeedUp Techniques for Simulation
 Telektronikk
, 1995
"... Due to increased complexity and extreme quality of service requirements, traditional means for performance evaluation of telecom networks do not always suffice. The most flexible approach has been, and still is, simulation, which is the main focus of this paper. However, severe problems regarding ef ..."
Abstract

Cited by 8 (5 self)
 Add to MetaCart
efficiency exist, e.g. evaluation of ATM cell loss rate in range of <10 9 which is very computer intensive and hardly feasible within reasonable time with direct simulation. This calls for new and more efficient simulation techniques. An overview of some speedup approaches is given. The paper also
Speedup via Quantum Sampling
 Physical Review A
, 2008
"... The Markov Chain Monte Carlo method is at the heart of most fullypolynomial randomized approximation schemes for #Pcomplete problems such as estimating the permanent or the value of a polytope. It is therefore very natural and important to determine whether quantum computers can speedup classical ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
The Markov Chain Monte Carlo method is at the heart of most fullypolynomial randomized approximation schemes for #Pcomplete problems such as estimating the permanent or the value of a polytope. It is therefore very natural and important to determine whether quantum computers can speedup
SpeedUp Techniques for ShortestPath Computations
 IN PROCEEDINGS OF THE 24TH INTERNATIONAL SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE (STACS’07
, 2007
"... During the last years, several speedup techniques for Dijkstra’s algorithm have been published that maintain the correctness of the algorithm but reduce its running time for typical instances. They are usually based on a preprocessing that annotates the graph with additional information which can ..."
Abstract

Cited by 20 (6 self)
 Add to MetaCart
During the last years, several speedup techniques for Dijkstra’s algorithm have been published that maintain the correctness of the algorithm but reduce its running time for typical instances. They are usually based on a preprocessing that annotates the graph with additional information which can
Understanding FaultTolerant Distributed Systems
 COMMUNICATIONS OF THE ACM
, 1993
"... We propose a small number of basic concepts that can be used to explain the architecture of faulttolerant distributed systems and we discuss a list of architectural issues that we find useful to consider when designing or examining such systems. For each issue we present known solutions and design ..."
Abstract

Cited by 374 (23 self)
 Add to MetaCart
We propose a small number of basic concepts that can be used to explain the architecture of faulttolerant distributed systems and we discuss a list of architectural issues that we find useful to consider when designing or examining such systems. For each issue we present known solutions and design alternatives, we discuss their relative merits and we give examples of systems which adopt one approach or the other. The aim is to introduce some order in the complex discipline of designing and understanding faulttolerant distributed systems.
Unbounded prooflength speedup in deduction modulo
 CSL 2007, VOLUME 4646 OF LNCS
, 2007
"... In 1973, Parikh proved a speedup theorem conjectured by Gödel 37 years before: there exist arithmetical formulæ that are provable in first order arithmetic, but whose shorter proof in second order arithmetic is arbitrarily smaller than any proof in first order. On the other hand, resolution for h ..."
Abstract

Cited by 7 (3 self)
 Add to MetaCart
In 1973, Parikh proved a speedup theorem conjectured by Gödel 37 years before: there exist arithmetical formulæ that are provable in first order arithmetic, but whose shorter proof in second order arithmetic is arbitrarily smaller than any proof in first order. On the other hand, resolution
On the Stability of InputBuffer Cell Switches with Speedup
 IEEE INFOCOM 2000, Tel Aviv
, 2000
"... We consider cellbased switch architectures, whose internal switching matrix does not provide enough speed to avoid input buffering. These architectures require a scheduling algorithm to select at each slot a subset of input buffered cells which can be transferred towards output ports. The stability ..."
Abstract

Cited by 12 (4 self)
 Add to MetaCart
We consider cellbased switch architectures, whose internal switching matrix does not provide enough speed to avoid input buffering. These architectures require a scheduling algorithm to select at each slot a subset of input buffered cells which can be transferred towards output ports
Heuristic SpeedUps for Learning in Complex Stochastic Environments
, 2005
"... We describe a novel methodology by which a software agent can learn to predict future events in complex stochastic environments together with an important heuristicbased acceleration technique for computing the prediction. This speedup enables us to use much more context in our predictions t ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
We describe a novel methodology by which a software agent can learn to predict future events in complex stochastic environments together with an important heuristicbased acceleration technique for computing the prediction. This speedup enables us to use much more context in our predictions
Quantum Speedup for Approximating Partition Functions
, 2008
"... We achieve a quantum speedup of fully polynomial randomized approximation schemes (FPRAS) for estimating partition functions that combine simulated annealing with the MonteCarlo Markov Chain method and use nonadaptive cooling schedules. The improvement in time complexity is twofold: a quadratic r ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
We achieve a quantum speedup of fully polynomial randomized approximation schemes (FPRAS) for estimating partition functions that combine simulated annealing with the MonteCarlo Markov Chain method and use nonadaptive cooling schedules. The improvement in time complexity is twofold: a quadratic
Epsilon, Delta, and SpeedUps WORK in PROGRESS
"... Abstract. This paper studies the applicability of Hilbert’s εcalculus in automated reasoning, in particular its incorporation in freevariable tableaux is investigated. Based on this study a careful comparison between δεtableaux [1] and δtableaux [8] becomes possible. Finally, in the spirit of [8 ..."
Abstract
 Add to MetaCart
of [8], a new liberalization of the δrule [3] is defined. This liberalization allows a nonelementary speedup over δtableaux. 1
Results 1  10
of
718,088