Sciweavers

8766 search results - page 1263 / 1754
» Functional logic programming
Sort
View
JFP
2002
96views more  JFP 2002»
15 years 4 months ago
Secrets of the Glasgow Haskell Compiler inliner
Higher-order languages, such as Haskell, encourage the proto build abstractions by composing functions. A good compiler must inline many of these calls to recover an e ciently exe...
Simon L. Peyton Jones, Simon Marlow
JUCS
2002
116views more  JUCS 2002»
15 years 4 months ago
Design for All as a Challenge for Hypermedia Engineering
: Design for All is an important challenge for hypermedia engineering. We analyze this challenge and show that it is necessary to find a way of describing partially designed hyperm...
Volker Mattick
MP
1998
134views more  MP 1998»
15 years 4 months ago
Second-order global optimality conditions for convex composite optimization
In recent years second-order sufficient conditions of an isolated local minimizer for convex composite optimization problems have been established. In this paper, second-order opt...
Xiaoqi Yang
SIAMJO
2002
124views more  SIAMJO 2002»
15 years 4 months ago
The Sample Average Approximation Method for Stochastic Discrete Optimization
In this paper we study a Monte Carlo simulation based approach to stochastic discrete optimization problems. The basic idea of such methods is that a random sample is generated and...
Anton J. Kleywegt, Alexander Shapiro, Tito Homem-d...
119
Voted
MP
2007
89views more  MP 2007»
15 years 4 months ago
Globally convergent limited memory bundle method for large-scale nonsmooth optimization
Many practical optimization problems involve nonsmooth (that is, not necessarily differentiable) functions of thousands of variables. In the paper [Haarala, Miettinen, M¨akel¨a,...
Napsu Haarala, Kaisa Miettinen, Marko M. Mäke...
« Prev « First page 1263 / 1754 Last » Next »