Results 1  10
of
3,456
Approximate Range Searching in External Memory
"... In this paper, we present two linearsize external memory data structures for approximate range searching. Our first structure, the BARBtree, stores a set of N points in R d and can report all points inside a query range Q by accessing O(log B N + ɛ γ + kɛ/B) disk blocks, where B is the disk blo ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
In this paper, we present two linearsize external memory data structures for approximate range searching. Our first structure, the BARBtree, stores a set of N points in R d and can report all points inside a query range Q by accessing O(log B N + ɛ γ + kɛ/B) disk blocks, where B is the disk
Tabu Search  Part I
, 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 problems for which it is best suited. This paper undertakes to present the major ideas and findings to date, and to indicate challenges for future research. Part I of this study indicates the basic principles, ranging from the shortterm memory process at the core of the search to the intermediate and long
A theory of memory retrieval
 PSYCHOL. REV
, 1978
"... A theory of memory retrieval is developed and is shown to apply over a range of experimental paradigms. Access to memory traces is viewed in terms of a resonance metaphor. The probe item evokes the search set on the basis of probememory item relatedness, just as a ringing tuning fork evokes sympath ..."
Abstract

Cited by 769 (83 self)
 Add to MetaCart
A theory of memory retrieval is developed and is shown to apply over a range of experimental paradigms. Access to memory traces is viewed in terms of a resonance metaphor. The probe item evokes the search set on the basis of probememory item relatedness, just as a ringing tuning fork evokes
Fast approximate nearest neighbors with automatic algorithm configuration
 In VISAPP International Conference on Computer Vision Theory and Applications
, 2009
"... nearestneighbors search, randomized kdtrees, hierarchical kmeans tree, clustering. For many computer vision problems, the most time consuming component consists of nearest neighbor matching in highdimensional spaces. There are no known exact algorithms for solving these highdimensional problems ..."
Abstract

Cited by 455 (2 self)
 Add to MetaCart
dimensional problems that are faster than linear search. Approximate algorithms are known to provide large speedups with only minor loss in accuracy, but many such algorithms have been published with only minimal guidance on selecting an algorithm and its parameters for any given problem. In this paper, we describe a
Approximating the nondominated front using the Pareto Archived Evolution Strategy
 EVOLUTIONARY COMPUTATION
, 2000
"... We introduce a simple evolution scheme for multiobjective optimization problems, called the Pareto Archived Evolution Strategy (PAES). We argue that PAES may represent the simplest possible nontrivial algorithm capable of generating diverse solutions in the Pareto optimal set. The algorithm, in its ..."
Abstract

Cited by 321 (19 self)
 Add to MetaCart
simplest form, is a (1 + 1) evolution strategy employing local search but using a reference archive of previously found solutions in order to identify the approximate dominance ranking of the current and candidate solution vectors. (1 + 1)PAES is intended to be a baseline approach against which more
Efficient 3D Range Searching in External Memory
 In Proc. ACM Symp. on Theory of Computation
, 1995
"... We present a new approach to designing data structures for the important problem of externalmemory range searching in two and three dimensions. We construct data structures for answering range queries in O((log log log B N) log B N + K=B) I/O operations, where N is the number of points in the data s ..."
Abstract

Cited by 30 (2 self)
 Add to MetaCart
We present a new approach to designing data structures for the important problem of externalmemory range searching in two and three dimensions. We construct data structures for answering range queries in O((log log log B N) log B N + K=B) I/O operations, where N is the number of points in the data
Taming the computational complexity of combinatorial auctions: Optimal and approximate approaches
, 1999
"... In combinatorial auctions, multiple goods are sold simultaneously and bidders may bid for arbitrary combinations of goods. Determining the outcome of such an auction is an optimization problem that is NPcomplete in the general case. We propose two methods of overcoming this apparent intractability. ..."
Abstract

Cited by 288 (9 self)
 Add to MetaCart
. The first method, which is guaranteed to be optimal, reduces running time by structuring the search space so that a modified depthfirst search usually avoids even considering allocations that contain conflicting bids. Caching and pruning are also used to speed searching. Our second method is a heuristic
Smodels  an Implementation of the Stable Model and WellFounded Semantics for Normal Logic Programs
, 1997
"... The Smodels system is a C++ implementation of the wellfounded and stable model semantics for rangerestricted functionfree normal programs. The system includes two modules: (i) smodels which implements the two semantics for ground programs and (ii) parse which computes a grounded version of a range ..."
Abstract

Cited by 294 (9 self)
 Add to MetaCart
up backtracking search where a powerful pruning method is employed. The pruning method exploits an approximation technique for stable models which is closely related to the wellfounded semantics. One of the advantages of this novel technique is that it can be implemented to work in linear space. This makes
Developments in the Measurement of Subjective WellBeing
 Psychological Science.
, 1993
"... F or good reasons, economists have had a longstanding preference for studying peoples' revealed preferences; that is, looking at individuals' actual choices and decisions rather than their stated intentions or subjective reports of likes and dislikes. Yet people often make choices that b ..."
Abstract

Cited by 284 (7 self)
 Add to MetaCart
of Economic Yet another use of subjective wellbeing has been to provide an external check on economic indicators. For example, Nordhaus (1998) and What are economists to make of this enterprise? Can wellbeing be measured by a subjective survey, even approximately? In this paper, we discuss research on how
Approximate Range Searching
 in Proc. 11th Annu. ACM Sympos. Comput. Geom
, 1995
"... The range searching problem is a fundamental problem in computational geometry, with numerous important applications. Most research has focused on solving this problem exactly, but lower bounds show that if linear space is assumed, the problem cannot be solved in polylogarithmic time, except for the ..."
Abstract

Cited by 91 (21 self)
 Add to MetaCart
The range searching problem is a fundamental problem in computational geometry, with numerous important applications. Most research has focused on solving this problem exactly, but lower bounds show that if linear space is assumed, the problem cannot be solved in polylogarithmic time, except
Results 1  10
of
3,456