Results 1  10
of
39,576
Expected Time Bounds for Selection
, 1975
"... A new selection algorithm is presented which is shown to be very efficient on the average, both theoretically and practically. The number of comparisons used to select the ith smallest of n numbers is n q min(i,ni) q o(n). A lower bound within 9 percent of the above formula is also derived. ..."
Abstract

Cited by 459 (4 self)
 Add to MetaCart
A new selection algorithm is presented which is shown to be very efficient on the average, both theoretically and practically. The number of comparisons used to select the ith smallest of n numbers is n q min(i,ni) q o(n). A lower bound within 9 percent of the above formula is also derived.
Time bound
, 2011
"... In this case study, we consider a temperature control system extended from a previous case study [4], originally studied by Alur et al. [1]. In this model, continuous distributions are used. The abstraction of a guarded command with a continuous probability distribution into one with a discrete prob ..."
Abstract
 Add to MetaCart
In this case study, we consider a temperature control system extended from a previous case study [4], originally studied by Alur et al. [1]. In this model, continuous distributions are used. The abstraction of a guarded command with a continuous probability distribution into one with a discrete probability distribution is described in a recent publication [2]. In Figure 1 we depict the system structure. We ask whether using an Figure 1: Model of the Temperature Control System air conditioning control system we are able to keep the temperature of a room within a certain range. In contrast to the water level case study, we use a nonlinear model of the temperature evolution, and instead of varying the splitting of the normal distribution, we vary the refine interval used by PHAVer [3] to analyse nonlinear hybrid systems. A smaller refine interval leads to a more precise abstraction of the statespace.
Reasoning the fast and frugal way: Models of bounded rationality.
 Psychological Review,
, 1996
"... Humans and animals make inferences about the world under limited time and knowledge. In contrast, many models of rational inference treat the mind as a Laplacean Demon, equipped with unlimited time, knowledge, and computational might. Following H. Simon's notion of satisncing, the authors have ..."
Abstract

Cited by 611 (30 self)
 Add to MetaCart
Humans and animals make inferences about the world under limited time and knowledge. In contrast, many models of rational inference treat the mind as a Laplacean Demon, equipped with unlimited time, knowledge, and computational might. Following H. Simon's notion of satisncing, the authors
Finding structure in time
 COGNITIVE SCIENCE
, 1990
"... Time underlies many interesting human behaviors. Thus, the question of how to represent time in connectionist models is very important. One approach is to represent time implicitly by its effects on processing rather than explicitly (as in a spatial representation). The current report develops a pro ..."
Abstract

Cited by 2071 (23 self)
 Add to MetaCart
Time underlies many interesting human behaviors. Thus, the question of how to represent time in connectionist models is very important. One approach is to represent time implicitly by its effects on processing rather than explicitly (as in a spatial representation). The current report develops a
An Efficient ContextFree Parsing Algorithm
, 1970
"... A parsing algorithm which seems to be the most efficient general contextfree algorithm known is described. It is similar to both Knuth's LR(k) algorithm and the familiar topdown algorithm. It has a time bound proportional to n 3 (where n is the length of the string being parsed) in general; i ..."
Abstract

Cited by 798 (0 self)
 Add to MetaCart
A parsing algorithm which seems to be the most efficient general contextfree algorithm known is described. It is similar to both Knuth's LR(k) algorithm and the familiar topdown algorithm. It has a time bound proportional to n 3 (where n is the length of the string being parsed) in general
Time, Clocks, and the Ordering of Events in a Distributed System
, 1978
"... The concept of one event happening before another in a distributed system is examined, and is shown to define a partial ordering of the events. A distributed algorithm is given for synchronizing a system of logical clocks which can be used to totally order the events. The use of the total ordering i ..."
Abstract

Cited by 2869 (14 self)
 Add to MetaCart
is illustrated with a method for solving synchronization problems. The algorithm is then specialized for synchronizing physical clocks, and a bound is derived on how far out of synchrony the clocks can become.
A Scheme for RealTime Channel Establishment in WideArea Networks
 IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS
, 1990
"... Multimedia communication involving digital audio and/or digital video has rather strict delay requirements. A realtime channel is defined in this paper as a simplex connection between a source and a destination characterized by parameters representing the performance requirements of the client. A r ..."
Abstract

Cited by 702 (31 self)
 Add to MetaCart
realtime service is capable of creating realtime channels on demand and guaranteeing their performance. These guarantees often take the form of lower bounds on the bandwidth allocated to a channel and upper bounds on the delays to be experienced by a packet on the channel. In this paper
Finitetime analysis of the multiarmed bandit problem
 Machine Learning
, 2002
"... Abstract. Reinforcement learning policies face the exploration versus exploitation dilemma, i.e. the search for a balance between exploring the environment to find profitable actions while taking the empirically best action as often as possible. A popular measure of a policy’s success in addressing ..."
Abstract

Cited by 817 (15 self)
 Add to MetaCart
this dilemma is the regret, that is the loss due to the fact that the globally optimal policy is not followed all the times. One of the simplest examples of the exploration/exploitation dilemma is the multiarmed bandit problem. Lai and Robbins were the first ones to show that the regret for this problem has
Localitysensitive hashing scheme based on pstable distributions
 In SCG ’04: Proceedings of the twentieth annual symposium on Computational geometry
, 2004
"... inÇÐÓ�Ò We present a novel LocalitySensitive Hashing scheme for the Approximate Nearest Neighbor Problem underÐÔnorm, based onÔstable distributions. Our scheme improves the running time of the earlier algorithm for the case of theÐnorm. It also yields the first known provably efficient approximate ..."
Abstract

Cited by 521 (8 self)
 Add to MetaCart
NN algorithm for the caseÔ�. We also show that the algorithm finds the exact near neigbhor time for data satisfying certain “bounded growth ” condition. Unlike earlier schemes, our LSH scheme works directly on points in the Euclidean space without embeddings. Consequently, the resulting query time
Results 1  10
of
39,576