6365 search results - page 951 / 1273 » Fast Local Computation Algorithms |
191
click to vote
ICWMC
2006
IEEE
16 years 25 days ago
2006
IEEE
Geographic routing in wireless sensor networks is based on the prerequisite that every node has information about its current position, for instance via GPS or some localization a...
180
click to vote
INFOCOM
2006
IEEE
16 years 25 days ago
2006
IEEE
—Flooding is one of the most fundamental operations in mobile ad hoc networks. Traditional implementation of flooding suffers from the problems of excessive redundancy of message...
180
click to vote
EVOW
2010
Springer
15 years 10 months ago
2010
Springer
Instances of constraint satisfaction problems can be solved efficiently if they are representable as a tree decomposition of small width. Unfortunately, the task of finding a deco...
153
click to vote
AAAI
2006
15 years 8 months ago
2006
The majority of the existing algorithms for learning decision trees are greedy--a tree is induced top-down, making locally optimal decisions at each node. In most cases, however, ...
173
click to vote
UAI
1996
15 years 8 months ago
1996
Two Bayesian-network structures are said to be equivalent if the set of distributions that can be represented with one of those structures is identical to the set of distributions...