Sciweavers

68 search results - page 1 / 14
» Sequential optimisation without state space exploration
Sort
View
ICCAD
1997
IEEE
66views Hardware» more  ICCAD 1997»
13 years 9 months ago
Sequential optimisation without state space exploration
We propose an algorithm for area optimisation of sequential circuits through redundancy removal. The algorithm finds compatible redundancies by implying values over nets in the c...
Amit Mehrotra, Shaz Qadeer, Vigyan Singhal, Robert...
CASES
2008
ACM
13 years 6 months ago
Exploring and predicting the architecture/optimising compiler co-design space
Embedded processor performance is dependent on both the underlying architecture and the compiler optimisations applied. However, designing both simultaneously is extremely difficu...
Christophe Dubach, Timothy M. Jones, Michael F. P....
TSE
2008
146views more  TSE 2008»
13 years 4 months ago
Delta Execution for Efficient State-Space Exploration of Object-Oriented Programs
We present Delta Execution, a technique that speeds up state-space exploration of object-oriented programs. Statespace exploration is the essence of model checking and an increasin...
Marcelo d'Amorim, Steven Lauterburg, Darko Marinov
ENTCS
2008
120views more  ENTCS 2008»
13 years 4 months ago
Separation Logic Semantics for Communicating Processes
This paper explores a unification of the ideas of Concurrent Separation Logic with those of Communicating Sequential Processes. It extends separation logic by an operator for sepa...
Tony Hoare, Peter W. O'Hearn
NN
2007
Springer
105views Neural Networks» more  NN 2007»
13 years 4 months ago
Guiding exploration by pre-existing knowledge without modifying reward
Reinforcement learning is based on exploration of the environment and receiving reward that indicates which actions taken by the agent are good and which ones are bad. In many app...
Kary Främling