Sciweavers

16188 search results - page 468 / 3238
» The Optimal PAC Algorithm
Sort
View
ASIAN
2004
Springer
109views Algorithms» more  ASIAN 2004»
16 years 1 months ago
Online Stochastic and Robust Optimization
This paper considers online stochastic optimization problems where uncertainties are characterized by a distribution that can be sampled and where time constraints severely limit t...
Russell Bent, Pascal Van Hentenryck
CDC
2009
IEEE
137views Control Systems» more  CDC 2009»
16 years 12 days ago
Kernel regression for travel time estimation via convex optimization
—We develop an algorithm aimed at estimating travel time on segments of a road network using a convex optimization framework. Sampled travel time from probe vehicles are assumed ...
Sebastien Blandin, Laurent El Ghaoui, Alexandre M....
POPL
2000
ACM
16 years 1 days ago
(Optimal) Duplication is not Elementary Recursive
In 1998 Asperti and Mairson proved that the cost of reducing a lambda-term using an optimal lambda-reducer (a la L´evy) cannot be bound by any elementary function in the number o...
Andrea Asperti, Paolo Coppola, Simone Martini
CEC
2007
IEEE
15 years 11 months ago
Optimizing low-thrust gravity assist interplanetary trajectories using evolutionary neurocontrollers
The combination of low-thrust propulsion and gravity assists allows designing high-energy missions. However the optimization of such trajectories is no trivial task. In this paper,...
I. Carnelli, B. Dachwald, M. Vasile
APPROX
2008
Springer
107views Algorithms» more  APPROX 2008»
15 years 9 months ago
A General Framework for Designing Approximation Schemes for Combinatorial Optimization Problems with Many Objectives Combined in
Abstract. In this paper, we propose a general framework for designing fully polynomial time approximation schemes for combinatorial optimization problems, in which more than one ob...
Shashi Mittal, Andreas S. Schulz