Sciweavers

10051 search results - page 1869 / 2011
» A Dynamic Separator Algorithm
Sort
View
111
Voted
POPL
2010
ACM
16 years 3 days ago
Compositional May-Must Program Analysis: Unleashing the Power of Alternation
Program analysis tools typically compute two types of information: (1) may information that is true of all program executions and is used to prove the absence of bugs in the progr...
Aditya V. Nori, Patrice Godefroid, SaiDeep Tetali,...
SI3D
2009
ACM
15 years 9 months ago
Soft irregular shadow mapping: fast, high-quality, and robust soft shadows
We introduce a straightforward, robust, and efficient algorithm for rendering high-quality soft shadows in dynamic scenes. Each frame, points in the scene visible from the eye ar...
Gregory S. Johnson, Warren A. Hunt, Allen Hux, Wil...
110
Voted
BIRTHDAY
2009
Springer
15 years 9 months ago
Hybrid BDD and All-SAT Method for Model Checking
We present a new hybrid BDD and SAT-based algorithm for model checking. Our algorithm is based on backward search, where each pre-image computation consists of an efficient All-SA...
Avi Yadgar, Orna Grumberg, Assaf Schuster
130
Voted
GLOBECOM
2009
IEEE
15 years 9 months ago
Hierarchical Network Formation Games in the Uplink of Multi-Hop Wireless Networks
— In this paper, we propose a game theoretic approach to tackle the problem of the distributed formation of the hierarchical network architecture that connects the nodes in the u...
Walid Saad, Quanyan Zhu, Tamer Basar, Zhu Han, Are...
114
Voted
INFOCOM
2009
IEEE
15 years 9 months ago
Estimating Hop Distance Between Arbitrary Host Pairs
—Establishing a clear and timely picture of Internet topology is complicated by many factors including the vast size and dynamic nature of the infrastructure. In this paper, we d...
Brian Eriksson, Paul Barford, Robert D. Nowak
« Prev « First page 1869 / 2011 Last » Next »