Results 1 - 10 of 94,001

Tabu Search -- Part I

by Fred Glover , 1989
"... This paper presents the fundamental principles underlying tabu search as a strategy for combinatorial optimization problems. Tabu search has achieved impressive practical successes in applications ranging from scheduling and computer channel balancing to cluster analysis and space planning, and more ..."
Abstract - Cited by 680 (11 self) - Add to MetaCart
of computational experience for a variety of applications. Part I1 of this study (to appear in a subsequent issue) examines more advanced considerations, applying the basic ideas to special settings and outlining a dynamic move structure to insure finiteness. Part I1 also describes tabu search methods for solving

R-trees: A Dynamic Index Structure for Spatial Searching

by Antonin Guttman - INTERNATIONAL CONFERENCE ON MANAGEMENT OF DATA , 1984
"... In order to handle spatial data efficiently, as required in computer aided design and geo-data applications, a database system needs an index mechanism that will help it retrieve data items quickly according to their spatial locations However, traditional indexing methods are not well suited to data ..."
Abstract - Cited by 2750 (0 self) - Add to MetaCart
to data objects of non-zero size located m multi-dimensional spaces In this paper we describe a dynamic index structure called an R-tree which meets this need, and give algorithms for searching and updating it. We present the results of a series of tests which indicate that the structure performs well

The structure and function of complex networks

by M. E. J. Newman - SIAM REVIEW , 2003
"... Inspired by empirical studies of networked systems such as the Internet, social networks, and biological networks, researchers have in recent years developed a variety of techniques and models to help us understand or predict the behavior of these systems. Here we review developments in this field, ..."
Abstract - Cited by 2600 (7 self) - Add to MetaCart
, including such concepts as the small-world effect, degree distributions, clustering, network correlations, random graph models, models of network growth and preferential attachment, and dynamical processes taking place on networks.

Finding structure in time

by Jeffrey L. Elman - 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
proposal along these lines first described by Jordan (1986) which involves the use of recurrent links in order to provide networks with a dynamic memory. In this approach, hidden unit patterns are fed back to themselves; the internal representations which develop thus reflect task demands in the context

ATTENTION, INTENTIONS, AND THE STRUCTURE OF DISCOURSE

by Barbara J. Grosz, Candace L. Sidner , 1986
"... In this paper we explore a new theory of discourse structure that stresses the role of purpose and processing in discourse. In this theory, discourse structure is composed of three separate but interre-lated components: the structure of the sequence of utterances (called the linguistic structure), a ..."
Abstract - Cited by 1259 (49 self) - Add to MetaCart
In this paper we explore a new theory of discourse structure that stresses the role of purpose and processing in discourse. In this theory, discourse structure is composed of three separate but interre-lated components: the structure of the sequence of utterances (called the linguistic structure

Dynamic source routing in ad hoc wireless networks

by David B. Johnson, David A. Maltz - Mobile Computing , 1996
"... An ad hoc network is a collection of wireless mobile hosts forming a temporary network without the aid of any established infrastructure or centralized administration. In such an environment, it may be necessary for one mobile host to enlist the aid of other hosts in forwarding a packet to its desti ..."
Abstract - Cited by 3108 (31 self) - Add to MetaCart
destination, due to the limited range of each mobile host’s wireless transmissions. This paper presents a protocol for routing in ad hoc networks that uses dynamic source routing. The protocol adapts quickly to routing changes when host movement is frequent, yet requires little or no overhead during periods

Distortion invariant object recognition in the dynamic link architecture

by Martin Lades, Jan C. Vorbrüggen, Joachim Buhmann, Christoph v. d. Malsburg, Rolf P. Würtz, Wolfgang Konen - IEEE TRANSACTIONS ON COMPUTERS , 1993
"... We present an object recognition system based on the Dynamic Link Architecture, which is an extension to classical Artificial Neural Networks. The Dynamic Link Architecture ex-ploits correlations in the fine-scale temporal structure of cellular signals in order to group neurons dynamically into hig ..."
Abstract - Cited by 637 (80 self) - Add to MetaCart
We present an object recognition system based on the Dynamic Link Architecture, which is an extension to classical Artificial Neural Networks. The Dynamic Link Architecture ex-ploits correlations in the fine-scale temporal structure of cellular signals in order to group neurons dynamically

Dynamic Bayesian Networks: Representation, Inference and Learning

by Kevin Patrick Murphy , 2002
"... Modelling sequential data is important in many areas of science and engineering. Hidden Markov models (HMMs) and Kalman filter models (KFMs) are popular for this because they are simple and flexible. For example, HMMs have been used for speech recognition and bio-sequence analysis, and KFMs have bee ..."
Abstract - Cited by 770 (3 self) - Add to MetaCart
been used for problems ranging from tracking planes and missiles to predicting the economy. However, HMMs and KFMs are limited in their “expressive power”. Dynamic Bayesian Networks (DBNs) generalize HMMs by allowing the state space to be represented in factored form, instead of as a single discrete

Bigtable: A distributed storage system for structured data

by Fay Chang, Jeffrey Dean, Sanjay Ghemawat, Wilson C. Hsieh, Deborah A. Wallach, Mike Burrows, Tushar Chandra, Andrew Fikes, Robert E. Gruber - IN PROCEEDINGS OF THE 7TH CONFERENCE ON USENIX SYMPOSIUM ON OPERATING SYSTEMS DESIGN AND IMPLEMENTATION - VOLUME 7 , 2006
"... Bigtable is a distributed storage system for managing structured data that is designed to scale to a very large size: petabytes of data across thousands of commodity servers. Many projects at Google store data in Bigtable, including web indexing, Google Earth, and Google Finance. These applications ..."
Abstract - Cited by 1028 (4 self) - Add to MetaCart
Bigtable is a distributed storage system for managing structured data that is designed to scale to a very large size: petabytes of data across thousands of commodity servers. Many projects at Google store data in Bigtable, including web indexing, Google Earth, and Google Finance. These applications

An Empirical Characterization of the Dynamic Effects of changes in Government Spending and Taxes on Output

by Olivier Blanchard, Roberto Perotti - QUARTERLY JOURNAL OF ECONOMICS , 2002
"... This paper characterizes the dynamic effects of shocks in government spending and taxes on U. S. activity in the postwar period. It does so by using a mixed structural VAR/event study approach. Identification is achieved by using institutional information about the tax and transfer systems to identi ..."
Abstract - Cited by 664 (9 self) - Add to MetaCart
This paper characterizes the dynamic effects of shocks in government spending and taxes on U. S. activity in the postwar period. It does so by using a mixed structural VAR/event study approach. Identification is achieved by using institutional information about the tax and transfer systems
Results 1 - 10 of 94,001