Sciweavers

108 search results - page 13 / 22
» Exact Exploration and Hanging Algorithms
Sort
View
MDM
2009
Springer
150views Communications» more  MDM 2009»
14 years 2 months ago
Perimeter-Based Data Replication in Mobile Sensor Networks
—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...
Panayiotis Andreou, Demetrios Zeinalipour-Yazti, M...
KDD
2009
ACM
208views Data Mining» more  KDD 2009»
14 years 8 months ago
A principled and flexible framework for finding alternative clusterings
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...
Zijie Qi, Ian Davidson
STOC
2001
ACM
147views Algorithms» more  STOC 2001»
14 years 8 months ago
Conditions on input vectors for consensus solvability in asynchronous distributed systems
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...
Achour Mostéfaoui, Michel Raynal, Sergio Ra...
RTCSA
2000
IEEE
14 years 7 days ago
Scheduling optional computations in fault-tolerant real-time systems
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...
Pedro Mejía-Alvarez, Hakan Aydin, Daniel Mo...
AAAI
2008
13 years 10 months ago
Exploiting Causal Independence Using Weighted Model Counting
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...
Wei Li 0002, Pascal Poupart, Peter van Beek