Sciweavers

945 search results - page 92 / 189
» Incremental Branching Programs
Sort
View
USENIX
2003
13 years 10 months ago
Multiprocessor Support for Event-Driven Programs
This paper presents a new asynchronous programming library (libasync-smp) that allows event-driven applications to take advantage of multiprocessors by running code for event hand...
Nickolai Zeldovich, Alexander Yip, Frank Dabek, Ro...
CEC
2010
IEEE
13 years 10 months ago
Generating a novel sort algorithm using Reinforcement Programming
Abstract-- Reinforcement Programming (RP) is a new approach to automatically generating algorithms, that uses reinforcement learning techniques. This paper describes the RP approac...
Spencer K. White, Tony R. Martinez, George L. Rudo...
ISQED
2007
IEEE
152views Hardware» more  ISQED 2007»
14 years 3 months ago
Variation Aware Timing Based Placement Using Fuzzy Programming
In nanometer regime, the effects of variations are having an increasing impact on the delay and power characteristics of devices as well as the yield of the circuit. Statistical t...
Venkataraman Mahalingam, N. Ranganathan
PASTE
1998
ACM
14 years 20 days ago
Efficient Composite Data Flow Analysis Applied to Concurrent Programs
FLAVERS, a tool for verifying properties of concurrent systems, uses composite data flow analysis to incrementally improve the precision of the results of its verifications. Altho...
Gleb Naumovich, Lori A. Clarke, Leon J. Osterweil
POPL
2009
ACM
14 years 9 months ago
Verifying liveness for asynchronous programs
Asynchronous or "event-driven" programming is a popular technique to efficiently and flexibly manage concurrent interactions. In these programs, the programmer can post ...
Pierre Ganty, Rupak Majumdar, Andrey Rybalchenko