Sciweavers

5214 search results - page 369 / 1043
» The Online Specialization Problem
Sort
View
AIPS
1996
15 years 8 months ago
Deduction-Based Refinement Planning
Weintroduce a method of deduction-based refinement planning where prefabricated general solutions are adapted to special problems. Refmementproceeds by stepwise transforming nonco...
Werner Stephan, Susanne Biundo
AUTOMATICA
2007
102views more  AUTOMATICA 2007»
15 years 7 months ago
An extension of duality to a game-theoretic framework
This paper extends some duality results from a standard optimization setup to a noncooperative (Nash) game framework. A Nash game (NG) with coupled constraints is considered. Solv...
Lacra Pavel
170
Voted
CORR
2010
Springer
146views Education» more  CORR 2010»
15 years 7 months ago
Adaptive Submodularity: A New Approach to Active Learning and Stochastic Optimization
Solving stochastic optimization problems under partial observability, where one needs to adaptively make decisions with uncertain outcomes, is a fundamental but notoriously diffic...
Daniel Golovin, Andreas Krause
CORR
2008
Springer
115views Education» more  CORR 2008»
15 years 7 months ago
Adaptive Sum Power Iterative Waterfilling for MIMO Cognitive Radio Channels
Abstract--In this paper, the sum capacity of the Gaussian Multiple Input Multiple Output (MIMO) Cognitive Radio Channel (MCC) is expressed as a convex problem with finite number of...
Rajiv Soundararajan, Sriram Vishwanath
CSDA
2008
56views more  CSDA 2008»
15 years 7 months ago
Robust designs for series estimation
We discuss optimal design problems for a popular method of series estimation in regression problems. Commonly used design criteria are based on the generalized variance of the est...
Holger Dette, Douglas P. Wiens