Sciweavers

8232 search results - page 460 / 1647
» Dynamic Logic Programming
Sort
View
MP
2010
156views more  MP 2010»
15 years 5 months ago
Representing the space of linear programs as the Grassmann manifold
: Each linear program (LP) has an optimal basis. The space of linear programs can be partitioned according to these bases, so called the basis partition. Discovering the structures...
Gongyun Zhao
ECOOP
1999
Springer
15 years 11 months ago
Towards Automatic Specialization of Java Programs
Abstract. Automatic program specialization can derive efficient implementations from generic components, thus reconciling the often opposing goals of genericity and efficiency. Thi...
Ulrik Pagh Schultz, Julia L. Lawall, Charles Conse...
PATAT
2004
Springer
148views Education» more  PATAT 2004»
16 years 7 days ago
Interactively Solving School Timetabling Problems Using Extensions of Constraint Programming
Timetabling problems have been frequently studied due to their wide range of applications. However, they are often solved manually because of the lack of appropriate computer tools...
Hadrien Cambazard, Fabien Demazeau, Narendra Jussi...
AUTOMATICA
2008
167views more  AUTOMATICA 2008»
15 years 7 months ago
Stability and robustness analysis of nonlinear systems via contraction metrics and SOS programming
A wide variety of stability and performance questions about linear dynamical systems can be reformulated as convex optimization problems involving linear matrix inequalities (LMIs...
Erin M. Aylward, Pablo A. Parrilo, Jean-Jacques E....
VMCAI
2010
Springer
16 years 4 months ago
Building a Calculus of Data Structures
Abstract. Techniques such as verification condition generation, preditraction, and expressive type systems reduce software verification to proving formulas in expressive logics. Pr...
Viktor Kuncak, Ruzica Piskac, Philippe Suter, Thom...