Sciweavers

1209 search results - page 29 / 242
» Approximation by pseudo-linear operators
Sort
View
76
Voted
QUESTA
2007
91views more  QUESTA 2007»
14 years 9 months ago
Iterative approximation of k -limited polling systems
The present paper deals with the problem of calculating queue length distributions in a polling model with (exhaustive) k-limited service under the assumption of general arrival, ...
M. van Vuuren, Erik M. M. Winands
GECCO
2009
Springer
112views Optimization» more  GECCO 2009»
15 years 4 months ago
Approximating geometric crossover in semantic space
We propose a crossover operator that works with genetic programming trees and is approximately geometric crossover in the semantic space. By defining semantic as program’s eval...
Krzysztof Krawiec, Pawel Lichocki
71
Voted
SAC
2006
ACM
15 years 4 months ago
A branch and prune algorithm for the approximation of non-linear AE-solution sets
Non-linear AE-solution sets are a special case of parametric systems of equations where universally quantified parameters appear first. They allow to model many practical situat...
Alexandre Goldsztejn
CONTEXT
2001
Springer
15 years 2 months ago
On the Dimensions of Context Dependence: Partiality, Approximation, and Perspective
Abstract. In this paper we propose to re-read the past work on formalizing context as the search for a logic of the relationships between partial, approximate, and perspectival the...
Massimo Benerecetti, Paolo Bouquet, Chiara Ghidini
91
Voted
SODA
2008
ACM
138views Algorithms» more  SODA 2008»
14 years 11 months ago
Fully polynomial time approximation schemes for stochastic dynamic programs
We develop a framework for obtaining Fully Polynomial Time Approximation Schemes (FPTASs) for stochastic univariate dynamic programs with either convex or monotone single-period c...
Nir Halman, Diego Klabjan, Chung-Lun Li, James B. ...