Results 1  10
of
1,133
Greedy Randomized Adaptive Search Procedures
, 2002
"... GRASP is a multistart metaheuristic for combinatorial problems, in which each iteration consists basically of two phases: construction and local search. The construction phase builds a feasible solution, whose neighborhood is investigated until a local minimum is found during the local search phas ..."
Abstract

Cited by 647 (82 self)
 Add to MetaCart
solution construction mechanisms and techniques to speed up the search are also described: Reactive GRASP, cost perturbations, bias functions, memory and learning, local search on partially constructed solutions, hashing, and filtering. We also discuss in detail implementation strategies of memory
Optimization of Perturb and Observe Maximum Power Point Tracking Method
"... Abstract—Maximum power point tracking (MPPT) techniques are used in photovoltaic (PV) systems to maximize the PV array output power by tracking continuously the maximum power point (MPP) which depends on panels temperature and on irradiance conditions. The issue of MPPT has been addressed in differe ..."
Abstract

Cited by 116 (2 self)
 Add to MetaCart
in different ways in the literature but, especially for lowcost implementations, the perturb and observe (P&O) maximum power point tracking algorithm is the most commonly used method due to its ease of implementation. A drawback of P&O is that, at steady state, the operating point oscillates around
Highly optimized tolerance: a mechanism for power laws in designed systems.
 Phys. Rev. E,
, 1999
"... We introduce a mechanism for generating power law distributions, referred to as highly optimized tolerance ͑HOT͒, which is motivated by biological organisms and advanced engineering technologies. Our focus is on systems which are optimized, either through natural selection or engineering design, to ..."
Abstract

Cited by 177 (10 self)
 Add to MetaCart
, to provide robust performance despite uncertain environments. We suggest that power laws in these systems are due to tradeoffs between yield, cost of resources, and tolerance to risks. These tradeoffs lead to highly optimized designs that allow for occasional large events. We investigate the mechanism
Search costs in quadtrees and singularity perturbation asymptotics
 Discrete Comput. Geom
, 1994
"... Abstract. Quadtrees constitute a classical data structure for storing and accessing collections of points in multidimensional space. It is proved that, in any dimension, the cost of a random search in a randomly grown quadtree has logarithmic mean and variance and is asymptotically distributed as a ..."
Abstract

Cited by 21 (5 self)
 Add to MetaCart
Abstract. Quadtrees constitute a classical data structure for storing and accessing collections of points in multidimensional space. It is proved that, in any dimension, the cost of a random search in a randomly grown quadtree has logarithmic mean and variance and is asymptotically distributed as a
Smooth sensitivity and sampling in private data analysis
 In STOC
, 2007
"... We introduce a new, generic framework for private data analysis. The goal of private data analysis is to release aggregate information about a data set while protecting the privacy of the individuals whose information the data set contains. Our framework allows one to release functions f of the data ..."
Abstract

Cited by 173 (16 self)
 Add to MetaCart
the noise magnitude to the smooth sensitivity of f on the database x — a measure of variability of f in the neighborhood of the instance x. The new framework greatly expands the applicability of output perturbation, a technique for protecting individuals ’ privacy by adding a small amount of random noise
Our Data, Ourselves: Privacy via Distributed Noise Generation
 In EUROCRYPT
, 2006
"... Abstract. In this work we provide efficient distributed protocols for generating shares of random noise, secure against malicious participants. The purpose of the noise generation is to create a distributed implementation of the privacypreserving statistical databases described in recent papers [14 ..."
Abstract

Cited by 152 (15 self)
 Add to MetaCart
[14,4,13]. In these databases, privacy is obtained by perturbing the true answer to a database query by the addition of a small amount of Gaussian or exponentially distributed random noise. The computational power of evenasimple form of these databases, when the queryis just of the form È i f
Reducing computational costs in the Basic Perturbation Lemma
, 2006
"... Homological Perturbation Theory [11, 13] is a wellknown general method for computing homology, but its main algorithm, the Basic Perturbation Lemma, presents, in general, high computational costs. In this paper, we propose a general strategy in order to reduce the complexity in some important for ..."
Abstract
 Add to MetaCart
Homological Perturbation Theory [11, 13] is a wellknown general method for computing homology, but its main algorithm, the Basic Perturbation Lemma, presents, in general, high computational costs. In this paper, we propose a general strategy in order to reduce the complexity in some important
Perturbation Analyses for the QR Factorization
 SIAM J. Matrix Anal. Appl
, 1997
"... This paper gives perturbation analyses for Q 1 and R in the QR factorization A = Q 1 R, Q T 1 Q 1 = I, for a given real m \Theta n matrix A of rank n. The analyses more accurately reflect the sensitivity of the problem than previous normwise results. The condition numbers here are altered by any c ..."
Abstract

Cited by 20 (11 self)
 Add to MetaCart
This paper gives perturbation analyses for Q 1 and R in the QR factorization A = Q 1 R, Q T 1 Q 1 = I, for a given real m \Theta n matrix A of rank n. The analyses more accurately reflect the sensitivity of the problem than previous normwise results. The condition numbers here are altered by any
Output Perturbation with Query Relaxation
, 2008
"... Given a dataset containing sensitive personal information, a statistical database answers aggregate queries in a manner that preserves individual privacy. We consider the problem of constructing a statistical database using output perturbation, which protects privacy by injecting a small noise into ..."
Abstract

Cited by 13 (0 self)
 Add to MetaCart
Given a dataset containing sensitive personal information, a statistical database answers aggregate queries in a manner that preserves individual privacy. We consider the problem of constructing a statistical database using output perturbation, which protects privacy by injecting a small noise
A higher order estimate of the optimum checkpoint interval for restart dumps
 Future Generation Computer Systems
, 2006
"... This paper examines methods of approximating the optimum checkpoint restart strategy for minimizing application run time on a system exhibiting Poisson single component failures. Two different models will be developed and compared. We will begin with a simplified cost function that yields a firstor ..."
Abstract

Cited by 123 (5 self)
 Add to MetaCart
order model. Then we will derive a more complete cost function and demonstrate a perturbation solution that provides accurate high order approximations to the optimum checkpoint interval.
Results 1  10
of
1,133