Sciweavers

2084 search results - page 332 / 417
» Proving Time Bounds for Randomized Distributed Algorithms
Sort
View
OSDI
2008
ACM
15 years 10 months ago
Probabilistic Inference in Queueing Networks
Although queueing models have long been used to model the performance of computer systems, they are out of favor with practitioners, because they have a reputation for requiring u...
Charles A. Sutton, Michael I. Jordan
ICCV
2005
IEEE
15 years 3 months ago
Learning Models for Predicting Recognition Performance
This paper addresses one of the fundamental problems encountered in performance prediction for object recognition. In particular we address the problems related to estimation of s...
Rong Wang, Bir Bhanu
INFOCOM
2005
IEEE
15 years 3 months ago
The impact of imperfect scheduling on cross-layer rate control in wireless networks
— In this paper, we study cross-layer design for rate control in multihop wireless networks. In our previous work, we have developed an optimal cross-layered rate control scheme ...
Xiaojun Lin, Ness B. Shroff
ICDCS
2000
IEEE
15 years 1 months ago
Graceful Quorum Reconfiguration in a Robust Emulation of Shared Memory
Providing shared-memory abstraction in messagepassing systems often simplifies the development of distributed algorithms and allows for the reuse of sharedmemory algorithms in the...
Burkhard Englert, Alexander A. Shvartsman
ICNSC
2008
IEEE
15 years 4 months ago
Facility Location Optimization via Multi-Agent Robotic Systems
— A facility location problem deals with locating the best place for a group of facilities, among distinct demand points, minimizing a certain locational optimization function. I...
Miad Moarref, Hassan Sayyadi