Sciweavers

2372 search results - page 134 / 475
» Probabilistic calling context
Sort
View
PLDI
2012
ACM
12 years 25 days ago
Parallelizing top-down interprocedural analyses
Modularity is a central theme in any scalable program analysis. The core idea in a modular analysis is to build summaries at procedure boundaries, and use the summary of a procedu...
Aws Albarghouthi, Rahul Kumar, Aditya V. Nori, Sri...
CGIM
2003
13 years 11 months ago
Silhouette-Opaque Transparency Rendering
Transparency in 3D graphics has traditionally been created by ordering the transparent objects from back-to-front with respect to the viewpoint, and rendering the opaque objects ï...
O. Sen, C. Chemudugunta, M. Gopi
AI
1999
Springer
13 years 10 months ago
Bucket Elimination: A Unifying Framework for Reasoning
Bucket elimination is an algorithmic framework that generalizes dynamic programming to accommodate many problem-solving and reasoning tasks. Algorithms such as directional-resolut...
Rina Dechter
SRDS
2010
IEEE
13 years 8 months ago
Shedding Light on Enterprise Network Failures Using Spotlight
Abstract--Fault localization in enterprise networks is extremely challenging. A recent approach called Sherlock makes some headway into this problem by using an inference algorithm...
Dipu John, Pawan Prakash, Ramana Rao Kompella, Ran...
LICS
1991
IEEE
14 years 1 months ago
Logic Programming in a Fragment of Intuitionistic Linear Logic
When logic programming is based on the proof theory of intuitionistic logic, it is natural to allow implications in goals and in the bodies of clauses. Attempting to prove a goal ...
Joshua S. Hodas, Dale Miller