Results 1  10
of
5,132,334
Statistical mechanics of complex networks
 Rev. Mod. Phys
"... Complex networks describe a wide range of systems in nature and society, much quoted examples including the cell, a network of chemicals linked by chemical reactions, or the Internet, a network of routers and computers connected by physical links. While traditionally these systems were modeled as ra ..."
Abstract

Cited by 2083 (10 self)
 Add to MetaCart
Complex networks describe a wide range of systems in nature and society, much quoted examples including the cell, a network of chemicals linked by chemical reactions, or the Internet, a network of routers and computers connected by physical links. While traditionally these systems were modeled
A New Kind of Science
, 2002
"... “Somebody says, ‘You know, you people always say that space is continuous. How do you know when you get to a small enough dimension that there really are enough points in between, that it isn’t just a lot of dots separated by little distances? ’ Or they say, ‘You know those quantum mechanical amplit ..."
Abstract

Cited by 850 (0 self)
 Add to MetaCart
“Somebody says, ‘You know, you people always say that space is continuous. How do you know when you get to a small enough dimension that there really are enough points in between, that it isn’t just a lot of dots separated by little distances? ’ Or they say, ‘You know those quantum mechanical
A Fast Quantum Mechanical Algorithm for Database Search
 ANNUAL ACM SYMPOSIUM ON THEORY OF COMPUTING
, 1996
"... Imagine a phone directory containing N names arranged in completely random order. In order to find someone's phone number with a probability of , any classical algorithm (whether deterministic or probabilistic)
will need to look at a minimum of names. Quantum mechanical systems can be in a supe ..."
Abstract

Cited by 1126 (10 self)
 Add to MetaCart
Imagine a phone directory containing N names arranged in completely random order. In order to find someone's phone number with a probability of , any classical algorithm (whether deterministic or probabilistic)
will need to look at a minimum of names. Quantum mechanical systems can be in a
Experiments with a New Boosting Algorithm
, 1996
"... In an earlier paper, we introduced a new “boosting” algorithm called AdaBoost which, theoretically, can be used to significantly reduce the error of any learning algorithm that consistently generates classifiers whose performance is a little better than random guessing. We also introduced the relate ..."
Abstract

Cited by 2176 (21 self)
 Add to MetaCart
In an earlier paper, we introduced a new “boosting” algorithm called AdaBoost which, theoretically, can be used to significantly reduce the error of any learning algorithm that consistently generates classifiers whose performance is a little better than random guessing. We also introduced
The Science of Monetary Policy: A New Keynesian Perspective
 Journal of Economic Literature
, 1999
"... “Having looked at monetary policy from both sides now, I can testify that central banking in practice is as much art as science. Nonetheless, while practicing this dark art, I have always found the science quEite useful.” 2 Alan S. Blinder ..."
Abstract

Cited by 1809 (45 self)
 Add to MetaCart
“Having looked at monetary policy from both sides now, I can testify that central banking in practice is as much art as science. Nonetheless, while practicing this dark art, I have always found the science quEite useful.” 2 Alan S. Blinder
Exact Sampling with Coupled Markov Chains and Applications to Statistical Mechanics
, 1996
"... For many applications it is useful to sample from a finite set of objects in accordance with some particular distribution. One approach is to run an ergodic (i.e., irreducible aperiodic) Markov chain whose stationary distribution is the desired distribution on this set; after the Markov chain has ..."
Abstract

Cited by 548 (13 self)
 Add to MetaCart
For many applications it is useful to sample from a finite set of objects in accordance with some particular distribution. One approach is to run an ergodic (i.e., irreducible aperiodic) Markov chain whose stationary distribution is the desired distribution on this set; after the Markov chain
TCP Vegas: New techniques for congestion detection and avoidance
 In SIGCOMM
, 1994
"... Vegas is a new implementation of TCP that achieves between 40 and 70 % better throughput, with onefifth to onehalf the losses, as compared to the implementation of TCP in the Reno distributionof BSD Unix. This paper motivates and describes the three key techniques employed by Vegas, and presents th ..."
Abstract

Cited by 592 (3 self)
 Add to MetaCart
Vegas is a new implementation of TCP that achieves between 40 and 70 % better throughput, with onefifth to onehalf the losses, as compared to the implementation of TCP in the Reno distributionof BSD Unix. This paper motivates and describes the three key techniques employed by Vegas, and presents
Supporting RealTime Applications in an Integrated Services Packet Network: Architecture and Mechanism
, 1992
"... This paper considers the support of realtime applications in an ..."
Abstract

Cited by 575 (25 self)
 Add to MetaCart
This paper considers the support of realtime applications in an
The New Science of Management Decision
 In Proceedings of the 33 rd Conference of the Operational Research Society of New Zealand
, 1960
"... Classical theories of choice emphasise decision making as a rational process. In general, these theories fail to recognise the formulation stages of a decision and typically can only be applied to problems comprising two or more measurable alternatives. In response to such limitations, numerous desc ..."
Abstract

Cited by 529 (1 self)
 Add to MetaCart
undertaken within a New Zealand local authority. Twenty three senior managers were interviewed about their decision making with the aim of comparing the responses of participants with how the descriptive decision making literature purports decisions are made. Evidence of behaviour consistent with recognised
Results 1  10
of
5,132,334