Sciweavers

Share
4 search results - page 1 / 1
» Stopping Rules for Randomized Greedy Triangulation Schemes
Sort
View
AAAI
2011
7 years 7 months ago
Stopping Rules for Randomized Greedy Triangulation Schemes
Many algorithms for performing inference in graphical models have complexity that is exponential in the treewidth - a parameter of the underlying graph structure. Computing the (m...
Andrew Gelfand, Kalev Kask, Rina Dechter
EOR
2010
116views more  EOR 2010»
8 years 7 months ago
Speeding up continuous GRASP
Continuous GRASP (C-GRASP) is a stochastic local search metaheuristic for finding cost-efficient solutions to continuous global optimization problems subject to box constraints (Hi...
Michael J. Hirsch, Panos M. Pardalos, Mauricio G. ...
CORR
2010
Springer
135views Education» more  CORR 2010»
8 years 7 months ago
A stochastic analysis of greedy routing in a spatially-dependent sensor network
For a sensor network, as tractable spatially-dependent node deployment model is presented with the property that the density is inversely proportional to the sink distance. A stoc...
H. Paul Keeler
TWC
2008
120views more  TWC 2008»
8 years 7 months ago
A cartel maintenance framework to enforce cooperation in wireless networks with selfish users
Abstract-- In distributed wireless networks without centralized control, each user is its own authority to maximize its own performance. This distributed characteristic provides th...
Zhu Han, Zhu Ji, K. J. Ray Liu
books