6155 search results - page 881 / 1231 » A language for multiple models of computation |
181
click to vote
SOFSEM
2010
Springer
16 years 3 months ago
2010
Springer
Regret minimization has proven to be a very powerful tool in both computational learning theory and online algorithms. Regret minimization algorithms can guarantee, for a single de...
190
click to vote
TSMC
2010
15 years 1 months ago
2010
We describe a cognitive architecture for creating more robust intelligent systems by executing hybrids of algorithms based on different computational formalisms. The architecture ...
190
click to vote
DAC
2006
ACM
16 years 7 months ago
2006
ACM
or Abstraction for the Functional Verification of FPGAs Guy Dupenloup, Thierry Lemeunier, Roland Mayr Altera Corporation 101 Innovation Drive San Jose, CA 95134 1-408-544-8672 {gdu...
172
click to vote
RSP
2008
IEEE
16 years 1 months ago
2008
IEEE
Dataflow formalisms have provided designers of digital signal processing systems with optimizations and guarantees to arrive at quality prototypes quickly. As system complexity in...
188
click to vote
CHARME
2003
Springer
15 years 12 months ago
2003
Springer
We present a non-operational approach to specifying and analyzing shared memory consistency models. The method uses higher order logic to capture a complete set of ordering constra...