492 search results - page 72 / 99 » Simplifying Probabilistic Programs Using Computer Algebra |
138
click to vote
TGC
2007
Springer
16 years 14 days ago
2007
Springer
Secure information flow analysis aims to prevent programs from leaking their H (high) inputs to their L (low) outputs. A major challenge in this area is to relax the standard noni...
185
Voted
TEC
2002
15 years 6 months ago
2002
Abstract--In this paper, we present an efficient graph-based evolutionary optimization technique called evolutionary graph generation (EGG) and the proposed approach is applied to ...
139
Voted
ICSE
2009
IEEE-ACM
16 years 7 months ago
2009
IEEE-ACM
ng Implementations from Abstraction Functions Derek Rayside, Zev Benjamin, Rishabh Singh, Joseph P. Near, Aleksandar Milicevic and Daniel Jackson Computer Science and Artificial In...
163
Voted
HPCA
2007
IEEE
16 years 6 months ago
2007
IEEE
Transactional Memory (TM) provides mechanisms that promise to simplify parallel programming by eliminating the need for locks and their associated problems (deadlock, livelock, pr...
157
Voted
NOCS
2009
IEEE
16 years 1 months ago
2009
IEEE
Future manycore processors will require energyefficient, high-throughput on-chip networks. Siliconphotonics is a promising new interconnect technology which offers lower power, h...