Results 1  10
of
180,901
OPTIMAL AND QUASIOPTIMAL DESIGNS ∗
"... • Optimal design theory deals with the choice of the allocation of the observations to accomplish the estimation of some linear combination of the coefficients in a regression model in an optimal way. Canonical moments provide an elegant framework to the theory of optimal designs. An optimal design ..."
Abstract
 Add to MetaCart
• Optimal design theory deals with the choice of the allocation of the observations to accomplish the estimation of some linear combination of the coefficients in a regression model in an optimal way. Canonical moments provide an elegant framework to the theory of optimal designs. An optimal
QuasiOptimal Cardinality . . .
, 2010
"... We examine adaptive finite element methods (AFEM) with any polynomial degree satisfying rather general assumptions on the a posteriori error estimators. We show that several nonresidual estimators satisfy these assumptions. We design an AFEM with single Dörfler marking for the sum of error estimat ..."
Abstract
 Add to MetaCart
estimator and oscillation, prove a contraction property for the socalled total error, namely the scaled sum of energy error and oscillation, and derive quasioptimal decay rates for the total error. We also reexamine the definition and role of oscillation in the approximation class.
QUASIOPTIMAL FILTERING IN INVERSE PROBLEMS
, 2003
"... A way of constructing a nonlinear filter close to the optimal Kolmogorov–Wiener filter is proposed within the framework of the statistical approach to inverse problems. Quasioptimal filtering, which has no Bayesian assumptions, produces stable and efficient solutions by relying solely on the inter ..."
Abstract
 Add to MetaCart
A way of constructing a nonlinear filter close to the optimal Kolmogorov–Wiener filter is proposed within the framework of the statistical approach to inverse problems. Quasioptimal filtering, which has no Bayesian assumptions, produces stable and efficient solutions by relying solely
QuasiOptimal Arithmetic for Quaternion Polynomials
, 2004
"... Abstract. Fast algorithms for arithmetic on real or complex polynomials are wellknown and have proven to be not only asymptotically efficient but also very practical. Based on Fast Fourier Transform, they for instance multiply two polynomials of degree up to n or multievaluate one at n points simul ..."
Abstract
 Add to MetaCart
to differ, each one satisfying some desirable properties while lacking others. For each notion, we devise algorithms for according arithmetic; these are quasioptimal in that their running times match lower complexity bounds up to polylogarithmic factors. 1
New Directions in Cryptography
, 1976
"... Two kinds of contemporary developments in cryptography are examined. Widening applications of teleprocessing have given rise to a need for new types of cryptographic systems, which minimize the need for secure key distribution channels and supply the equivalent of a written signature. This paper sug ..."
Abstract

Cited by 3499 (7 self)
 Add to MetaCart
suggests ways to solve these currently open problems. It also discusses how the theories of communication and computation are beginning to provide the tools to solve cryptographic problems of long standing.
On the Private Provision of Public Goods
 Journal of Public Economics
, 1986
"... We consider a general model of the noncooperative provision of a public good. Under very weak assumptions there will always exist a unique Nash equilibrium in our model. A small redistribution of wealth among the contributing consumers will not change the equilibrium amount of the public good. Howe ..."
Abstract

Cited by 546 (8 self)
 Add to MetaCart
. However, larger redistributions of wealth will change the set of contributors and thereby change the equilibrium provision of the public good. We are able to characterize the properties and the comparative statics of the equilibrium in a quite complete way and to analyze the extent to which government
The modern industrial revolution, exit, and the failure of internal control systems
 JOURNAL OF FINANCE
, 1993
"... Since 1973 technological, political, regulatory, and economic forces have been changing the worldwide economy in a fashion comparable to the changes experienced during the nineteenth century Industrial Revolution. As in the nineteenth century, we are experiencing declining costs, increaing average ( ..."
Abstract

Cited by 932 (7 self)
 Add to MetaCart
and the requirement for exit. The next several decades pose a major challenge for Western firms and political systems as these forces continue to work their way through the worldwide economy.
A Framework for Dynamic Graph Drawing
 CONGRESSUS NUMERANTIUM
, 1992
"... Drawing graphs is an important problem that combines flavors of computational geometry and graph theory. Applications can be found in a variety of areas including circuit layout, network management, software engineering, and graphics. The main contributions of this paper can be summarized as follows ..."
Abstract

Cited by 627 (44 self)
 Add to MetaCart
graphs. These algorithms adopt a variety of representations (e.g., straightline, polyline, visibility), and update the drawing in a smooth way.
Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
 SIAM Journal on Optimization
, 1993
"... We study the semidefinite programming problem (SDP), i.e the problem of optimization of a linear function of a symmetric matrix subject to linear equality constraints and the additional condition that the matrix be positive semidefinite. First we review the classical cone duality as specialized to S ..."
Abstract

Cited by 557 (12 self)
 Add to MetaCart
mechanical way to algorithms for SDP with proofs of convergence and polynomial time complexity also carrying over in a similar fashion. Finally we study the significance of these results in a variety of combinatorial optimization problems including the general 01 integer programs, the maximum clique
The particel swarm: Explosion, stability, and convergence in a multidimensional complex space
 IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTION
"... The particle swarm is an algorithm for finding optimal regions of complex search spaces through interaction of individuals in a population of particles. Though the algorithm, which is based on a metaphor of social interaction, has been shown to perform well, researchers have not adequately explained ..."
Abstract

Cited by 822 (10 self)
 Add to MetaCart
’s convergence tendencies. Some results of the particle swarm optimizer, implementing modifications derived from the analysis, suggest methods for altering the original algorithm in ways that eliminate problems and increase the optimization power of the particle swarm
Results 1  10
of
180,901