Sciweavers

463 search results - page 54 / 93
» The Most Reliable Subgraph Problem
Sort
View
IPPS
2003
IEEE
15 years 7 months ago
Performance Analysis of Distributed Search in Open Agent Systems
In open multi-agent systems agents need resources provided by other agents but they are not aware of which agents provide the particular resources. Most solutions to this problem ...
Vassilios V. Dimakopoulos, Evaggelia Pitoura
IPPS
2000
IEEE
15 years 6 months ago
Consensus Based on Failure Detectors with a Perpetual Accuracy Property
This paper is on the Consensus problem, in the context of asynchronous distributed systems made of n processes, at most f of them may crash. A family of failure detector classes s...
Achour Mostéfaoui, Michel Raynal
ML
2008
ACM
156views Machine Learning» more  ML 2008»
15 years 1 months ago
On the connection between the phase transition of the covering test and the learning success rate in ILP
It is well-known that heuristic search in ILP is prone to plateau phenomena. An explanation can be given after the work of Giordana and Saitta: the ILP covering test is NP-complete...
Érick Alphonse, Aomar Osmani
117
Voted
INFOCOM
2010
IEEE
15 years 12 days ago
MIMO-Aware Routing in Wireless Mesh Networks
Abstract—Multiple-input and multiple-output (MIMO) technique is considered as one of the most promising emerging wireless technologies that can significantly improve transmissio...
Shan Chu, Xin Wang
CVPR
1999
IEEE
1071views Computer Vision» more  CVPR 1999»
16 years 4 months ago
Adaptive Background Mixture Models for Real-Time Tracking
A common method for real-time segmentation of moving regions in image sequences involves "background subtraction," or thresholding the error between an estimate of the i...
Chris Stauffer, W. Eric L. Grimson