Sciweavers

805 search results - page 14 / 161
» Solving Consensus Using Structural Failure Models
Sort
View
SDM
2012
SIAM
252views Data Mining» more  SDM 2012»
13 years 2 months ago
Learning from Heterogeneous Sources via Gradient Boosting Consensus
Multiple data sources containing different types of features may be available for a given task. For instance, users’ profiles can be used to build recommendation systems. In a...
Xiaoxiao Shi, Jean-François Paiement, David...
ICRA
2006
IEEE
98views Robotics» more  ICRA 2006»
15 years 5 months ago
Sensor Selection and Placement for Failure Diagnosis in Networked Aerial Robots
Abstract—Unmanned aerial vehicles (UAVs) represent an important class of networked robotic applications that must be both highly dependable and autonomous. This paper addresses s...
Nagarajan Kandasamy, Fadi A. Aloul, Tak-John Koo
CP
2007
Springer
15 years 5 months ago
Structural Relaxations by Variable Renaming and Their Compilation for Solving MinCostSAT
Searching for optimal solutions to a problem using lower bounds obtained from a relaxation is a common idea in Heuristic Search and Planning. In SAT and CSPs, however, explicit rel...
Miquel Ramírez, Hector Geffner
FOCS
1993
IEEE
15 years 3 months ago
A Tight Lower Bound for k-Set Agreement
: Weprove tight bounds on the time needed to solve k-set agreement, a natural generalization of consensus. We analyze this problem in a synchronous, message-passing model where pro...
Soma Chaudhuri, Maurice Herlihy, Nancy A. Lynch, M...
SODA
2012
ACM
174views Algorithms» more  SODA 2012»
13 years 2 months ago
Using hashing to solve the dictionary problem
We consider the dictionary problem in external memory and improve the update time of the wellknown buffer tree by roughly a logarithmic factor. For any λ ≥ max{lg lg n, logM/B(...
John Iacono, Mihai Patrascu