952 search results - page 107 / 191 » Computational complexity of stochastic programming problems |
150
click to vote
LOPSTR
2005
Springer
15 years 8 months ago
2005
Springer
We propose an extension of functional logic languages that allows the definition of operations with patterns containing other defined operation symbols. Such “function patterns...
136
click to vote
LCPC
2007
Springer
15 years 9 months ago
2007
Springer
Program dynamic optimization, adaptive to runtime behavior changes, has become increasingly important for both performance and energy savings. However, most runtime optimizations o...
115
click to vote
EVOW
2001
Springer
15 years 7 months ago
2001
Springer
Abstract. This work describes the use of genetic algorithms for automating the photogrammetric network design process. When planning a photogrammetric network, the cameras should b...
127
click to vote
LPAR
2001
Springer
15 years 7 months ago
2001
Springer
When it comes to building robot controllers, highlevel programming arises as a feasible alternative to planning. The task then is to verify a high-level program by finding a lega...
ICALP
2005
Springer
15 years 8 months ago
2005
Springer
Abstract. We study the problem of determining the complexity of optimal comparison-based in-place sorting when the key length, k, is not a constant. We present the first algorithm...