Results 1  10
of
51,707
Pareto near–optimal strategy of multimodeling systems
 In Proc. IEEE Int. Conf. IECON01
, 2001
"... Abstract—In this paper, we study the Pareto near–optimal strategy for multiparameter singularly perturbed system (MSPS). The main contribution is to propose a new method for obtaining the Pareto near–optimal strategy. We show that the resulting near–optimal strategy achieves the cost functional J∗j ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
Abstract—In this paper, we study the Pareto near–optimal strategy for multiparameter singularly perturbed system (MSPS). The main contribution is to propose a new method for obtaining the Pareto near–optimal strategy. We show that the resulting near–optimal strategy achieves the cost functional J
ICGA 1 NEAROPTIMAL STRATEGIES FOR THE GAME OF LOGIK
"... Logik is an interesting variation of the game of Mastermind. For the latter several strategies have been proposed. We present some computational results for existing and new strategies applied to Logik. Our results give some indication on the scalability and applicability of these strategies to simi ..."
Abstract
 Add to MetaCart
Logik is an interesting variation of the game of Mastermind. For the latter several strategies have been proposed. We present some computational results for existing and new strategies applied to Logik. Our results give some indication on the scalability and applicability of these strategies
Computing near optimal strategies for stochastic investment planning problems
 In Proceedings of the Sixteenth International Joint Conference on Arti Intelligence
, 1999
"... We present efficient techniques for computing near optimal strategies for a class of stochastic commodity trading problems modeled as Markov decision processes (MDPs). The process has a continuous state space and a large action space and cannot be solved efficiently by standard dynamic programming m ..."
Abstract

Cited by 5 (2 self)
 Add to MetaCart
We present efficient techniques for computing near optimal strategies for a class of stochastic commodity trading problems modeled as Markov decision processes (MDPs). The process has a continuous state space and a large action space and cannot be solved efficiently by standard dynamic programming
Computing Near Optimal Strategies for Stochastic Investment Planning Problems
"... We present efficient techniques for computing near optimal strategies for a class of stochastic commodity trading problems modeled as Markov decision processes (MDPs). The process has a continuous state space and a large action space and cannot be solved efficiently by standard dynamic programming m ..."
Abstract
 Add to MetaCart
We present efficient techniques for computing near optimal strategies for a class of stochastic commodity trading problems modeled as Markov decision processes (MDPs). The process has a continuous state space and a large action space and cannot be solved efficiently by standard dynamic programming
Near Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
, 2004
"... Suppose we are given a vector f in RN. How many linear measurements do we need to make about f to be able to recover f to within precision ɛ in the Euclidean (ℓ2) metric? Or more exactly, suppose we are interested in a class F of such objects— discrete digital signals, images, etc; how many linear m ..."
Abstract

Cited by 1513 (20 self)
 Add to MetaCart
Suppose we are given a vector f in RN. How many linear measurements do we need to make about f to be able to recover f to within precision ɛ in the Euclidean (ℓ2) metric? Or more exactly, suppose we are interested in a class F of such objects— discrete digital signals, images, etc; how many linear measurements do we need to recover objects from this class to within accuracy ɛ? This paper shows that if the objects of interest are sparse or compressible in the sense that the reordered entries of a signal f ∈ F decay like a powerlaw (or if the coefficient sequence of f in a fixed basis decays like a powerlaw), then it is possible to reconstruct f to within very high accuracy from a small number of random measurements. typical result is as follows: we rearrange the entries of f (or its coefficients in a fixed basis) in decreasing order of magnitude f  (1) ≥ f  (2) ≥... ≥ f  (N), and define the weakℓp ball as the class F of those elements whose entries obey the power decay law f  (n) ≤ C · n −1/p. We take measurements 〈f, Xk〉, k = 1,..., K, where the Xk are Ndimensional Gaussian
Nearly optimal strategies for special cases of online capital investment
 Theoretical Computer Science
, 2003
"... Suppose that some job must be done for a period of unspecified duration. The market offers a selection of devices that can do this job, each characterized by purchase and running costs. Which of them should we buy at what times, in order to minimize the total costs? As usual in competitive analysis, ..."
Abstract

Cited by 7 (0 self)
 Add to MetaCart
, the cost of an online solution is compared to the optimum costs paid by a clearvoyant buyer. This problem which generalizes the basic renttobuy problem has been introduced by Y. Azar et al. In the socalled convex case where lower running costs always imply higher prices, a strategy with competitive
Optimal Brain Damage
, 1990
"... We have used informationtheoretic ideas to derive a class of practical and nearly optimal schemes for adapting the size of a neural network. By removing unimportant weights from a network, several improvements can be expected: better generalization, fewer training examples required, and improved sp ..."
Abstract

Cited by 510 (5 self)
 Add to MetaCart
We have used informationtheoretic ideas to derive a class of practical and nearly optimal schemes for adapting the size of a neural network. By removing unimportant weights from a network, several improvements can be expected: better generalization, fewer training examples required, and improved
Cooperative strategies and capacity theorems for relay networks
 IEEE TRANS. INFORM. THEORY
, 2005
"... Coding strategies that exploit node cooperation are developed for relay networks. Two basic schemes are studied: the relays decodeandforward the source message to the destination, or they compressandforward their channel outputs to the destination. The decodeandforward scheme is a variant of ..."
Abstract

Cited by 739 (19 self)
 Add to MetaCart
outputs and the destination’s channel output. The strategies are applied to wireless channels, and it is shown that decodeandforward achieves the ergodic capacity with phase fading if phase information is available only locally, and if the relays are near the source node. The ergodic capacity coincides
Nearoptimal hashing algorithms for approximate nearest neighbor in high dimensions
, 2008
"... In this article, we give an overview of efficient algorithms for the approximate and exact nearest neighbor problem. The goal is to preprocess a dataset of objects (e.g., images) so that later, given a new query object, one can quickly return the dataset object that is most similar to the query. The ..."
Abstract

Cited by 457 (7 self)
 Add to MetaCart
In this article, we give an overview of efficient algorithms for the approximate and exact nearest neighbor problem. The goal is to preprocess a dataset of objects (e.g., images) so that later, given a new query object, one can quickly return the dataset object that is most similar to the query. The problem is of significant interest in a wide variety of areas.
Efficient Variants of the ICP Algorithm
 INTERNATIONAL CONFERENCE ON 3D DIGITAL IMAGING AND MODELING
, 2001
"... The ICP (Iterative Closest Point) algorithm is widely used for geometric alignment of threedimensional models when an initial estimate of the relative pose is known. Many variants of ICP have been proposed, affecting all phases of the algorithm from the selection and matching of points to the minim ..."
Abstract

Cited by 718 (5 self)
 Add to MetaCart
to the minimization strategy. We enumerate and classify many of these variants, and evaluate their effect on the speed with which the correct alignment is reached. In order to improve convergence for nearlyflat meshes with small features, such as inscribed surfaces, we introduce a new variant based on uniform
Results 1  10
of
51,707