Results 1 - 10
of
184
A Nonlinear Programming Algorithm for Solving Semidefinite Programs via Low-rank Factorization
- Mathematical Programming (series B
, 2001
"... In this paper, we present a nonlinear programming algorithm for solving semidefinite programs (SDPs) in standard form. The algorithm's distinguishing feature is a change of variables that replaces the symmetric, positive semidefinite variable X of the SDP with a rectangular variable R according ..."
Abstract
-
Cited by 159 (10 self)
- Add to MetaCart
according to the factorization X = RR T . The rank of the factorization, i.e., the number of columns of R, is chosen minimally so as to enhance computational speed while maintaining equivalence with the SDP. Fundamental results concerning the convergence of the algorithm are derived, and encouraging
Routing for Energy Minimization in the Speed Scaling Model
"... Abstract—We study network optimization that considers energy minimization as an objective. Studies have shown that mechanisms such as speed scaling can significantly reduce the power consumption of telecommunication networks by matching the consumption of each network element to the amount of proces ..."
Abstract
-
Cited by 11 (0 self)
- Add to MetaCart
Abstract—We study network optimization that considers energy minimization as an objective. Studies have shown that mechanisms such as speed scaling can significantly reduce the power consumption of telecommunication networks by matching the consumption of each network element to the amount
Energy Efficient Multiprocessor Scheduling via Configuration LP
"... Energy minimization is an important issue in our days [8]. One of the main mechanisms for reducing the energy consumption in modern computer systems is the use of speed scalable processors. Starting from the seminal paper of Yao et al. [16], many papers adopted the speed-scaling model in which if a ..."
Abstract
- Add to MetaCart
Energy minimization is an important issue in our days [8]. One of the main mechanisms for reducing the energy consumption in modern computer systems is the use of speed scalable processors. Starting from the seminal paper of Yao et al. [16], many papers adopted the speed-scaling model in which if a
Early Detection of Combustion Instability from Hi-speed Flame Images via Deep Learning and Symbolic Time Series Analysis
"... Combustion instability has many detrimental effects on flight-propulsion dynamics and structural integrity of gas turbine engines and its early detection is one of the important tasks in engine health monitoring and prognostics. Combustion in-stability is characterized by self-sustained, large-ampli ..."
Abstract
- Add to MetaCart
-amplitude pressure oscillations and periodic shedding of coherent vor-tex structures at varied spatial scales. It is caused when lo-calized hydrodynamic perturbations in fluid flow fluctuations are augmented by heat release, coupled with acoustics of the combustion chamber. This paper proposes a dynamic data
Energy Efficient Scheduling and Routing via Randomized Rounding
"... We propose a unifying framework based on configuration linear programs and randomized rounding, for different energy optimization problems in the dynamic speed-scaling setting. We apply our framework to various scheduling and routing problems in heterogeneous computing and networking environments. W ..."
Abstract
- Add to MetaCart
We propose a unifying framework based on configuration linear programs and randomized rounding, for different energy optimization problems in the dynamic speed-scaling setting. We apply our framework to various scheduling and routing problems in heterogeneous computing and networking environments
Scaling Nonparametric Bayesian Inference via Subsample-Annealing
"... We describe an adaptation of the simulated annealing algorithm to nonparametric clus-tering and related probabilistic models. This new algorithm learns nonparamet-ric latent structure over a growing and constantly churning subsample of training data, where the portion of data subsampled can be inter ..."
Abstract
- Add to MetaCart
in simulated an-nealing). We prove subsample annealing speeds up mixing time N2 → N in a simple clustering model and exp(N) → N in an-other class of models, where N is data size. Empirically subsample-annealing outper-forms naive Gibbs sampling in accuracy-per-wallclock time, and can scale to larger datasets
Design and Implementation for an Android based Massively Multiplayer Online Augmented Reality Game Entwurf und Implementierung für ein Android basiertes Massively Multiplayer Online Augmented Reality Game
, 2014
"... Hiermit versichere ich, die vorliegende Master-Thesis ohne Hilfe Dritter nur mit den an-gegebenen Quellen und Hilfsmitteln angefertigt zu haben. Alle Stellen, die aus Quellen entnommen wurden, sind als solche kenntlich gemacht. Diese Arbeit hat in gleicher oder ähnlicher Form noch keiner Prüfungsbeh ..."
Abstract
- Add to MetaCart
Prüfungsbehörde vorgelegen. Darmstadt, den 28th February 2014 (Denis Lapiner) This Master’s Thesis proposes and implements a game design for an Android based massively multiplayer online augmented reality game. The proposed game design is based on an analysis of other popular aug-mented reality games
Energy-efficient CPU scheduling for multimedia applications
- ACM Trans. on Computer Syst
, 2005
"... This paper presents the design, implementation, and evaluation of GRACE-OS, an energy-efficient real-time CPU scheduler for multimedia applications running on a mobile device. GRACE-OS seeks to minimize the total energy consumed by the device while meeting multimedia timing requirements. To achieve ..."
Abstract
-
Cited by 21 (0 self)
- Add to MetaCart
This paper presents the design, implementation, and evaluation of GRACE-OS, an energy-efficient real-time CPU scheduler for multimedia applications running on a mobile device. GRACE-OS seeks to minimize the total energy consumed by the device while meeting multimedia timing requirements. To achieve
Energy Efficient Scheduling of Parallelizable Jobs
"... In this paper, we consider scheduling parallelizable jobs in the non-clairvoyant speed scaling setting to minimize the objective of weighted flow time plus energy. Previously, strong lower bounds were shown on this model in the unweighted setting even when the algorithm is given a constant amount of ..."
Abstract
-
Cited by 5 (2 self)
- Add to MetaCart
In this paper, we consider scheduling parallelizable jobs in the non-clairvoyant speed scaling setting to minimize the objective of weighted flow time plus energy. Previously, strong lower bounds were shown on this model in the unweighted setting even when the algorithm is given a constant amount
Human sensorimotor learning: adaptation, skill, and beyond.
- Current Opinion in Neurobiology,
, 2011
"... Recent studies of upper limb movements have provided insights into the computations, mechanisms, and taxonomy of human sensorimotor learning. Motor tasks differ with respect to how they weight different learning processes. These include adaptation, an internal-model based process that reduces senso ..."
Abstract
-
Cited by 12 (0 self)
- Add to MetaCart
is recorded through quantitative movement analysis, reveal regularities and performance patterns at the behavioral level, which suggest organizational principles for learning. Computational modeling offers normative principles, such as optimal Bayesian estimation and minimization of costs, to explain
Results 1 - 10
of
184