Sciweavers

3221 search results - page 212 / 645
» Termination of Linear Programs
Sort
View
GECCO
2005
Springer
162views Optimization» more  GECCO 2005»
15 years 12 months ago
Discovering biological motifs with genetic programming
Choosing the right representation for a problem is important. In this article we introduce a linear genetic programming approach for motif discovery in protein families, and we al...
Rolv Seehuus, Amund Tveit, Ole Edsberg
JAIR
2010
115views more  JAIR 2010»
15 years 4 months ago
An Investigation into Mathematical Programming for Finite Horizon Decentralized POMDPs
Decentralized planning in uncertain environments is a complex task generally dealt with by using a decision-theoretic approach, mainly through the framework of Decentralized Parti...
Raghav Aras, Alain Dutech
IEICET
2007
110views more  IEICET 2007»
15 years 6 months ago
A Higher-Order Knuth-Bendix Procedure and Its Applications
The completeness (i.e. confluent and terminating) property is an important concept when using a term rewriting system (TRS) as a computational model of functional programming lang...
Keiichirou Kusakari, Yuki Chiba
IFIP
2005
Springer
15 years 12 months ago
A New Low Rank Quasi-Newton Update Scheme for Nonlinear Programming
A new quasi-Newton scheme for updating a low rank positive semi-definite Hessian approximation is described, primarily for use in sequential quadratic programming methods for non...
R. Fletcher
SIAMJO
2008
92views more  SIAMJO 2008»
15 years 6 months ago
An Active-Set Newton Method for Mathematical Programs with Complementarity Constraints
For a mathematical program with complementarity constraints (MPCC), we propose an active-set Newton method, which has the property of local quadratic convergence under the MPCC lin...
Alexey F. Izmailov, Mikhail V. Solodov