Sciweavers

1157 search results - page 208 / 232
» Solving iterated functions using genetic programming
Sort
View
131
Voted
WABI
2005
Springer
120views Bioinformatics» more  WABI 2005»
15 years 8 months ago
Multiple Structural RNA Alignment with Lagrangian Relaxation
In contrast to proteins, many classes of functionally related RNA molecules show a rather weak sequence conservation but instead a fairly well conserved secondary structure. Hence ...
Markus Bauer, Gunnar W. Klau, Knut Reinert
153
Voted
SIAMJO
2002
133views more  SIAMJO 2002»
15 years 2 months ago
SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization
Abstract. Sequential quadratic programming (SQP) methods have proved highly effective for solving constrained optimization problems with smooth nonlinear functions in the objective...
Philip E. Gill, Walter Murray, Michael A. Saunders
158
Voted
MCMASTER
1993
15 years 6 months ago
A Taste of Rewrite Systems
Abstract. This survey of the theory and applications of rewriting with equations discusses the existence and uniqueness of normal forms, the Knuth-Bendix completion procedure and i...
Nachum Dershowitz
123
Voted
CDC
2010
IEEE
151views Control Systems» more  CDC 2010»
14 years 9 months ago
Convergence of discrete-time approximations of constrained linear-quadratic optimal control problems
Abstract-- Continuous-time linear constrained optimal control problems are in practice often solved using discretization techniques, e.g. in model predictive control (MPC). This re...
Lanshan Han, M. Kanat Camlibel, Jong-Shi Pang, W. ...
121
Voted
JGO
2010
100views more  JGO 2010»
14 years 9 months ago
On convex relaxations of quadrilinear terms
The best known method to find exact or at least -approximate solutions to polynomial programming problems is the spatial Branch-and-Bound algorithm, which rests on computing lower...
Sonia Cafieri, Jon Lee, Leo Liberti