108 search results - page 13 / 22 » Exact Exploration and Hanging Algorithms |
MDM
2009
Springer
15 years 4 months ago
2009
Springer
—This paper assumes a set of n mobile sensors that move in the Euclidean plane as a swarm. Our objectives are to explore a given geographic region by detecting spatio-temporal ev...
74
Voted
KDD
2009
ACM
15 years 10 months ago
2009
ACM
The aim of data mining is to find novel and actionable insights in data. However, most algorithms typically just find a single (possibly non-novel/actionable) interpretation of th...
STOC
2001
ACM
15 years 10 months ago
2001
ACM
This article introduces and explores the condition-based approach to solve the consensus problem in asynchronous systems. The approach studies conditions that identify sets of inpu...
RTCSA
2000
IEEE
15 years 2 months ago
2000
IEEE
This paper introduces an exact schedulability analysis for the optional computation model urider a specified failure hypothesis. From this analysis, we propose a solutionfor deter...
98
Voted
AAAI
2008
14 years 12 months ago
2008
Previous studies have demonstrated that encoding a Bayesian network into a SAT-CNF formula and then performing weighted model counting using a backtracking search algorithm can be...