Sciweavers

4047 search results - page 130 / 810
» The Discrete Basis Problem
Sort
View
MP
2008
137views more  MP 2008»
15 years 21 days ago
Valid inequalities and restrictions for stochastic programming problems with first order stochastic dominance constraints
Stochastic dominance relations are well-studied in statistics, decision theory and economics. Recently, there has been significant interest in introducing dominance relations into...
Nilay Noyan, Andrzej Ruszczynski
CCDS
2010
122views more  CCDS 2010»
14 years 10 months ago
The problem of mutually unbiased bases in dimension 6
We outline a discretization approach to determine the maximal number of mutually unbiased bases in dimension 6. We describe the basic ideas and introduce the most important definit...
Philippe Jaming, Máté Matolcsi, P&ea...
90
Voted
MOC
2010
14 years 7 months ago
hp-Optimal discontinuous Galerkin methods for linear elliptic problems
Abstract. The aim of this paper is to present and analyze a class of hpversion discontinuous Galerkin (DG) discretizations for the numerical approximation of linear elliptic proble...
Benjamin Stamm, Thomas P. Wihler
90
Voted
HYBRID
2007
Springer
15 years 7 months ago
Groupoids in Control Systems and the Reachability Problem for a Class of Quantized Control Systems with Nonabelian Symmetries
The aim of this paper is twofold. On one hand we present an approach to the general problem of nonlinear control in the framework of (differentiable) groupoids, which, in our opin...
Alessandro Arsie, Emilio Frazzoli
ICTCS
2001
Springer
15 years 5 months ago
Job Shop Scheduling Problems with Controllable Processing Times
In this paper we study the job shop scheduling problem under the assumption that the jobs have controllable processing times. The fact that the jobs have controllable processing t...
Klaus Jansen, Monaldo Mastrolilli, Roberto Solis-O...