Sciweavers

3946 search results - page 281 / 790
» The computational complexity of choice sets
Sort
View
DGCI
2000
Springer
15 years 11 months ago
A New Means for Investigating 3-Manifolds
The paper presents a new method of investigating topological properties of three-dimensional manifolds by means of computers. Manifolds are represented as finite cell complexes. Th...
Vladimir Kovalevsky
MP
2008
117views more  MP 2008»
15 years 6 months ago
Stochastic programming approach to optimization under uncertainty
In this paper we discuss computational complexity and risk averse approaches to two and multistage stochastic programming problems. We argue that two stage (say linear) stochastic ...
Alexander Shapiro
CSMR
2000
IEEE
15 years 11 months ago
Foundations of Enterprise Software Deployment
While Software Engineering has mainly focused so far on software development, software deployment is now emerging as a new research field. Software or Application deployment is a ...
Thierry Coupaye, Jacky Estublier
AUTOMATICA
2004
122views more  AUTOMATICA 2004»
15 years 6 months ago
Approximate explicit receding horizon control of constrained nonlinear systems
An algorithm for the construction of an explicit piecewise linear state feedback approximation to nonlinear constrained receding horizon control is given. It allows such controlle...
Tor Arne Johansen
CORR
2010
Springer
139views Education» more  CORR 2010»
15 years 1 months ago
A recombination algorithm for the decomposition of multivariate rational functions
In this paper we show how we can compute in a deterministic way the decomposition of a multivariate rational function with a recombination strategy. The key point of our recombinat...
Guillaume Chèze