Sciweavers

1064 search results - page 50 / 213
» Exact Algorithms for the Quadratic Linear Ordering Problem
Sort
View
ICML
2005
IEEE
16 years 4 months ago
Learning as search optimization: approximate large margin methods for structured prediction
Mappings to structured output spaces (strings, trees, partitions, etc.) are typically learned using extensions of classification algorithms to simple graphical structures (eg., li...
Daniel Marcu, Hal Daumé III
ISCAS
2005
IEEE
179views Hardware» more  ISCAS 2005»
15 years 9 months ago
Robust stabilization of control systems using piecewise linear Lyapunov functions and evolutionary algorithm
— Piecewise linear Lyapunov functions are used to design control gain matrices so that closed systems are robust stable and attractive regions are expanded as large as possible i...
K. Tagawa, Y. Ohta
SIAMJO
2002
133views more  SIAMJO 2002»
15 years 3 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
123
Voted
AAAI
1998
15 years 5 months ago
Fast Transformation of Temporal Plans for Efficient Execution
Temporal plans permit significant flexibility in specifying the occurrence time of events. Plan execution can make good use of that flexibility. However, the advantage of executio...
Ioannis Tsamardinos, Nicola Muscettola, Paul H. Mo...
COMGEO
2010
ACM
15 years 4 months ago
Exact join detection for convex polyhedra and other numerical abstractions
r Numerical Abstractions6 Roberto Bagnaraa , Patricia M. Hillb , Enea Zaffanellaa aDepartment of Mathematics, University of Parma, Italy bSchool of Computing, University of Leeds, ...
Roberto Bagnara, Patricia M. Hill, Enea Zaffanella