Sciweavers

952 search results - page 112 / 191
» Computational complexity of stochastic programming problems
Sort
View
ICALP
2003
Springer
15 years 8 months ago
Analysis of a Simple Evolutionary Algorithm for Minimization in Euclidean Spaces
Although evolutionary algorithms (EAs) are widely used in practical optimization, their theoretical analysis is still in its infancy. Up to now results on the (expected) runtime ar...
Jens Jägersküpper
STOC
2005
ACM
167views Algorithms» more  STOC 2005»
16 years 3 months ago
Approximately counting integral flows and cell-bounded contingency tables
We consider the problem of approximately counting integral flows in a network. We show that there is an fpras based on volume estimation if all capacities are sufficiently large, ...
Mary Cryan, Martin E. Dyer, Dana Randall
IPPS
2003
IEEE
15 years 8 months ago
MIP Formulation for Robust Resource Allocation in Dynamic Real-Time Systems
Real-time systems usually operate in an environment that changes continuously. These changes cause the performance of the system to vary during run time. An allocation of resource...
Sethavidh Gertphol, Viktor K. Prasanna
CDC
2010
IEEE
130views Control Systems» more  CDC 2010»
14 years 10 months ago
A fast well-conditioned interior point method for predictive control
Interior point methods (IPMs) have proven to be an efficient way of solving quadratic programming problems in predictive control. A linear system of equations needs to be solved in...
Amir Shahzad, Eric C. Kerrigan, George A. Constant...
ITICSE
1997
ACM
15 years 7 months ago
Recursion and grammars for CS2
A programming exercise on recursion in which students create drawings of simple and bracketed Lindenmayer Systems provides a context for exploring additional computer science conc...
Viera K. Proulx