Sciweavers

10608 search results - page 635 / 2122
» Complexity of O'Hara's Algorithm
Sort
View
SIAMJO
2008
93views more  SIAMJO 2008»
15 years 7 months ago
Smooth Optimization with Approximate Gradient
We show that the optimal complexity of Nesterov's smooth first-order optimization algorithm is preserved when the gradient is only computed up to a small, uniformly bounded er...
Alexandre d'Aspremont
TSP
2008
99views more  TSP 2008»
15 years 7 months ago
Sphere Decoding With a Probabilistic Tree Pruning
In this paper, we present a near ML-achieving sphere decoding algorithm that reduces the number of search operations in the sphere-constrained search. Specifically, by adding a pro...
Byonghyo Shim, Insung Kang
AUTOMATICA
2004
122views more  AUTOMATICA 2004»
15 years 7 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
NECO
2002
117views more  NECO 2002»
15 years 6 months ago
Bayesian A* Tree Search with Expected O(N) Node Expansions: Applications to Road Tracking
Many perception, reasoning, and learning problems can be expressed as Bayesian inference. We point out that formulating a problem as Bayesian inference implies specifying a probabi...
James M. Coughlan, Alan L. Yuille
CCE
2008
15 years 6 months ago
Scheduling of a mixed batch/continuous sugar milling plant using Petri nets
Scheduling of processes in mixed batch/continuous plants, due to their hybrid nature can become very complex. This paper presents the Timed Hybrid Petri net (THPN) as a suitable t...
Mahsa Ghaeli, Parisa A. Bahri, Peter L. Lee