Sciweavers

884 search results - page 42 / 177
» Control structures in programs and computational complexity
Sort
View
COGSR
2011
105views more  COGSR 2011»
13 years 2 months ago
Inductive rule learning on the knowledge level
We present an application of the analytical inductive programming system Igor to learning sets of recursive rules from positive experience. We propose that this approach can be us...
Ute Schmid, Emanuel Kitzelmann
MICCAI
2010
Springer
13 years 6 months ago
Construction of Neuroanatomical Shape Complex Atlas from 3D Brain MRI
Abstract. This paper proposes a novel technique for constructing a neuroanatomical shape complex atlas using an information geometry framework. A shape complex is a collection of s...
Ting Chen, Anand Rangarajan, Stephan J. Eisenschen...
MP
2008
99views more  MP 2008»
13 years 7 months ago
Efficient robust optimization for robust control with constraints
This paper proposes an efficient computational technique for the optimal control of linear discrete-time systems subject to bounded disturbances with mixed polytopic constraints o...
Paul J. Goulart, Eric C. Kerrigan, Daniel Ralph
ENTCS
2007
103views more  ENTCS 2007»
13 years 7 months ago
Static Slicing of Rewrite Systems
Program slicing is a method for decomposing programs by analyzing their data and control flow. Slicingbased techniques have many applications in the field of software engineerin...
Diego Cheda, Josep Silva, Germán Vidal
CDC
2010
IEEE
136views Control Systems» more  CDC 2010»
13 years 2 months ago
Pathologies of temporal difference methods in approximate dynamic programming
Approximate policy iteration methods based on temporal differences are popular in practice, and have been tested extensively, dating to the early nineties, but the associated conve...
Dimitri P. Bertsekas