Sciweavers

936 search results - page 127 / 188
» The Synthesis Problem of Netcharts
Sort
View
RAS
2008
80views more  RAS 2008»
15 years 2 months ago
Motion design and learning of autonomous robots based on primitives and heuristic cost-to-go
The task of trajectory design of autonomous vehicles is typically two-fold. First, it needs to take into account the intrinsic dynamics of the vehicle, which are sometimes termed ...
Keyong Li, Raffaello D'Andrea
AUTOMATICA
2011
14 years 10 months ago
Sequential linear quadratic control of bilinear parabolic PDEs based on POD model reduction
We present a framework to solve a finite-time optimal control problem for parabolic partial differential equations (PDEs) with diffusivity-interior actuators, which is motivate...
Chao Xu, Yongsheng Ou, Eugenio Schuster
TOG
2010
117views more  TOG 2010»
14 years 10 months ago
Multi-feature matching of fresco fragments
We present a multiple-feature approach for determining matches between small fragments of archaeological artifacts such as Bronze-Age and Roman frescoes. In contrast with traditio...
Corey Toler-Franklin, Benedict J. Brown, Tim Weyri...
DAC
2008
ACM
16 years 4 months ago
Bi-decomposing large Boolean functions via interpolation and satisfiability solving
Boolean function bi-decomposition is a fundamental operation in logic synthesis. A function f(X) is bi-decomposable under a variable partition XA, XB, XC on X if it can be written...
Ruei-Rung Lee, Jie-Hong Roland Jiang, Wei-Lun Hung
153
Voted
ASPLOS
2006
ACM
15 years 9 months ago
Combinatorial sketching for finite programs
Sketching is a software synthesis approach where the programmer develops a partial implementation — a sketch — and a separate specification of the desired functionality. The ...
Armando Solar-Lezama, Liviu Tancau, Rastislav Bod&...