Sciweavers

1449 search results - page 202 / 290
» Finiteness results for sigmoidal
Sort
View
CORR
2008
Springer
70views Education» more  CORR 2008»
15 years 6 months ago
Every Computably Enumerable Random Real Is Provably Computably Enumerable Random
We prove that every computably enumerable (c.e.) random real is provable in Peano Arithmetic (PA) to be c.e. random. A major step in the proof is to show that the theorem stating ...
Cristian S. Calude, Nicholas J. Hay
CORR
2008
Springer
102views Education» more  CORR 2008»
15 years 6 months ago
Game Theory with Costly Computation
We develop a general game-theoretic framework for reasoning about strategic agents performing possibly costly computation. In this framework, many traditional game-theoretic resul...
Joseph Y. Halpern, Rafael Pass
EOR
2008
70views more  EOR 2008»
15 years 6 months ago
Robust portfolio selection based on a multi-stage scenario tree
The aim of this paper is to apply the concept of robust optimization introduced by Bel-Tal and Nemirovski to the portfolio selection problems based on multi-stage scenario trees. ...
Ruijun Shen, Shuzhong Zhang
DSP
2006
15 years 6 months ago
Blind image deconvolution via dispersion minimization
In linear image restoration, the point spread function of the degrading system is assumed known even though this information is usually not available in real applications. As a re...
C. Vural, William A. Sethares
JSAC
2006
112views more  JSAC 2006»
15 years 6 months ago
Optimal Bandwidth Allocation in a Delay Channel
In this paper, we consider the problem of allocating bandwidth to two queues with arbitrary arrival processes, so as to minimize the total expected packet holding cost over a finit...
Navid Ehsan, Mingyan Liu