1159 search results - page 141 / 232 » Binary Decision Graphs |
147
click to vote
SIGMETRICS
2005
ACM
15 years 12 months ago
2005
ACM
—To model P2P networks that are commonly faced with high rates of churn and random departure decisions by end-users, this paper investigates the resilience of random graphs to li...
171
click to vote
CC
2006
Springer
15 years 10 months ago
2006
Springer
We introduce a new class of compiler heuristics: hybrid optimizations. Hybrid optimizations choose dynamically at compile time which optimization algorithm to apply from a set of d...
191
click to vote
DIALM
2005
ACM
15 years 8 months ago
2005
ACM
The identification of holes in a wireless sensor network is of primary interest since the breakdown of sensor nodes in a larger area often indicates one of the special events to ...
181
click to vote
NETWORKS
2010
15 years 4 months ago
2010
We consider a probabilistic model for the Steiner Tree problem. Under this model the problem is defined in a 2-stage setting over a first-stage complete weighted graph having it...
165
click to vote
WWW
2007
ACM
16 years 7 months ago
2007
ACM
Current keyword-oriented search engines for the World Wide Web do not allow specifying the semantics of queries. We address this limitation with NAGA1 , a new semantic search engi...