Results 1  10
of
8,760
Competitive Algorithms
"... Abstract—In thermal power plants, biomedical instrumentation the popular use of proportionalintegralderivative (PID) controllers can be noted. Proper tuning of such controllers is obviously a prime priority as any other alternative situation will require a high degree of industrial expertise. So i ..."
Abstract
 Add to MetaCart
. Particle swarm optimization (PSO) and Imperialist competitive algorithm (ICA) are the two props used to get the optimal PID gains. ICA proves to be more robust than PSO in performing optimal transient performance even under various nominal operating conditions. Computational time required by PSO is more
Competitive Algorithms for Distributed Data Management
 In Proceedings of the 24th Annual ACM Symposium on Theory of Computing
"... We deal with the competitive analysis of algorithms for managing data in a distributed environment. We deal with the file allocation problem ([DF], [ML]), where copies of a file may be be stored in the local storage of some subset of processors. Copies may be replicated and discarded over time so ..."
Abstract

Cited by 101 (8 self)
 Add to MetaCart
We deal with the competitive analysis of algorithms for managing data in a distributed environment. We deal with the file allocation problem ([DF], [ML]), where copies of a file may be be stored in the local storage of some subset of processors. Copies may be replicated and discarded over time
Region Competition: Unifying Snakes, Region Growing, and Bayes/MDL for Multiband Image Segmentation
 IEEE Transactions on Pattern Analysis and Machine Intelligence
, 1996
"... We present a novel statistical and variational approach to image segmentation based on a new algorithm named region competition. This algorithm is derived by minimizing a generalized Bayes/MDL criterion using the variational principle. The algorithm is guaranteed to converge to a local minimum and c ..."
Abstract

Cited by 774 (20 self)
 Add to MetaCart
We present a novel statistical and variational approach to image segmentation based on a new algorithm named region competition. This algorithm is derived by minimizing a generalized Bayes/MDL criterion using the variational principle. The algorithm is guaranteed to converge to a local minimum
Fast Parallel Algorithms for ShortRange Molecular Dynamics
 JOURNAL OF COMPUTATIONAL PHYSICS
, 1995
"... Three parallel algorithms for classical molecular dynamics are presented. The first assigns each processor a fixed subset of atoms; the second assigns each a fixed subset of interatomic forces to compute; the third assigns each a fixed spatial region. The algorithms are suitable for molecular dyn ..."
Abstract

Cited by 653 (7 self)
 Add to MetaCart
Three parallel algorithms for classical molecular dynamics are presented. The first assigns each processor a fixed subset of atoms; the second assigns each a fixed subset of interatomic forces to compute; the third assigns each a fixed spatial region. The algorithms are suitable for molecular
A constantcompetitive algorithm . . .
, 2007
"... Orthogonal Variable Spreading Factor (OVSF) code assignment is a fundamental problem in Wideband CodeDivision MultipleAccess (WCDMA) systems, which plays an important role in third generation mobile communications. In the OVSF problem, codes must be assigned to incoming call requests with differ ..."
Abstract
 Add to MetaCart
must contain at most one assigned code. In this paper, we focus on the online version of the OVSF code assignment problem and give a 10competitive algorithm (where the cost is measured by the total number of assignments and reassignments used). Our algorithm improves the previous O(h)competitive
Competitive Algorithms for Online Pricing
"... Abstract. Given a seller with m amount of items, a sequence of users {u1,u2,...} come one by one, the seller must set the unit price and assign some amount of items to each user on his/her arrival. Items can be sold fractionally. Each ui has his/her value function vi(·) such that vi(x) is the highes ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
of the competitive ratio is O(log h), then give an online algorithm with competitive ratio O(log h); if h is not known in advance, we give an online algorithm with competitive ratio O(h 3log−1/2 h 1
Competitive Algorithms for Replication and Migration Problems
, 1989
"... document without permission of its author may be prohibited by law. ..."
Abstract

Cited by 69 (1 self)
 Add to MetaCart
document without permission of its author may be prohibited by law.
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
have proposed a family of algorithms based on a simple psychological mechanism: onereason decision making. These fast and frugal algorithms violate fundamental tenets of classical rationality: They neither look up nor integrate all information. By computer simulation, the authors held a competition
An experimental comparison of three methods for constructing ensembles of decision trees
 Bagging, boosting, and randomization. Machine Learning
, 2000
"... Abstract. Bagging and boosting are methods that generate a diverse ensemble of classifiers by manipulating the training data given to a “base ” learning algorithm. Breiman has pointed out that they rely for their effectiveness on the instability of the base learning algorithm. An alternative approac ..."
Abstract

Cited by 610 (6 self)
 Add to MetaCart
of the decisiontree algorithm C4.5. The experiments show that in situations with little or no classification noise, randomization is competitive with (and perhaps slightly superior to) bagging but not as accurate as boosting. In situations with substantial classification noise, bagging is much better than
The design and implementation of FFTW3
 PROCEEDINGS OF THE IEEE
, 2005
"... FFTW is an implementation of the discrete Fourier transform (DFT) that adapts to the hardware in order to maximize performance. This paper shows that such an approach can yield an implementation that is competitive with handoptimized libraries, and describes the software structure that makes our cu ..."
Abstract

Cited by 726 (3 self)
 Add to MetaCart
FFTW is an implementation of the discrete Fourier transform (DFT) that adapts to the hardware in order to maximize performance. This paper shows that such an approach can yield an implementation that is competitive with handoptimized libraries, and describes the software structure that makes our
Results 1  10
of
8,760