Sciweavers

1258 search results - page 61 / 252
» Table design in dynamic programming
Sort
View
ICCCN
2007
IEEE
15 years 6 months ago
Lagniappe: Multi-* Programming Made Simple
—The emergence of multi-processor, multi-threaded architectures (referred to as multi- architectures) facilitates the design of high-throughput request processing systems (e.g., ...
Taylor L. Riché, R. Greg Lavender, Harrick ...
ASPLOS
2012
ACM
13 years 7 months ago
Architecture support for disciplined approximate programming
Disciplined approximate programming lets programmers declare which parts of a program can be computed approximately and consequently at a lower energy cost. The compiler proves st...
Hadi Esmaeilzadeh, Adrian Sampson, Luis Ceze, Doug...
IPPS
2005
IEEE
15 years 5 months ago
Building on a Framework: Using FG for More Flexibility and Improved Performance in Parallel Programs
We describe new features of FG that are designed to improve performance and extend the range of computations that fit into its framework. FG (short for Framework Generator) is a ...
Elena Riccio Davidson, Thomas H. Cormen
EAAI
2008
128views more  EAAI 2008»
14 years 12 months ago
Dual heuristic programming based nonlinear optimal control for a synchronous generator
This paper presents the design of an infinite horizon nonlinear optimal neurocontroller that replaces the conventional automatic voltage regulator and the turbine governor (CONVC)...
Jung-Wook Park, Ronald G. Harley, Ganesh K. Venaya...
PADL
2007
Springer
15 years 6 months ago
Partial Evaluation of Pointcuts
Abstract. In aspect-oriented programming, pointcuts are usually compiled by identifying a set of shadows — that is, places in the code whose execution is potentially relevant for...
Karl Klose, Klaus Ostermann, Michael Leuschel