Sciweavers

9626 search results - page 1410 / 1926
» Invariant Based Programming
Sort
View
CC
2008
Springer
137views System Software» more  CC 2008»
15 years 9 months ago
On the Relative Completeness of Bytecode Analysis Versus Source Code Analysis
Abstract. We discuss the challenges faced by bytecode analyzers designed for code verification compared to similar analyzers for source code. While a bytecode-level analysis brings...
Francesco Logozzo, Manuel Fähndrich
ASPDAC
2005
ACM
92views Hardware» more  ASPDAC 2005»
15 years 9 months ago
An LP-based methodology for improved timing-driven placement
— A method for timing driven placement is presented. The core of the approach is optimal timing-driven relaxed placement based on a linear programming (LP) formulation. The formu...
Qingzhou (Ben) Wang, John Lillis, Shubhankar Sanya...
CG
2006
Springer
15 years 9 months ago
Feature Construction for Reinforcement Learning in Hearts
Temporal difference (TD) learning has been used to learn strong evaluation functions in a variety of two-player games. TD-gammon illustrated how the combination of game tree search...
Nathan R. Sturtevant, Adam M. White
DAC
2005
ACM
15 years 9 months ago
Template-driven parasitic-aware optimization of analog integrated circuit layouts
Layout parasitics have great impact on analog circuit performance. This paper presents an algorithm for explicit parasitic control during layout retargeting of analog integrated c...
Sambuddha Bhattacharya, Nuttorn Jangkrajarng, C.-J...
ADAEUROPE
2007
Springer
15 years 8 months ago
Automatic Ada Code Generation Using a Model-Driven Engineering Approach
Currently, Model-Driven Engineering (MDE) is considered one of the most promising approaches for software development. In this paper, a simple but complete example based on state-m...
Diego Alonso, Cristina Vicente-Chicote, Pedro S&aa...
« Prev « First page 1410 / 1926 Last » Next »