Sciweavers

565 search results - page 38 / 113
» Geometry of Upper Probabilities
Sort
View
JPDC
2007
173views more  JPDC 2007»
13 years 7 months ago
Probabilistic analysis on mesh network fault tolerance
Mesh networks are among the most important interconnection network topologies for large multicomputer systems. Mesh networks perform poorly in tolerating faults in the view of wor...
Jianer Chen, Gaocai Wang, Chuang Lin, Tao Wang, Gu...
STOC
2003
ACM
95views Algorithms» more  STOC 2003»
14 years 7 months ago
Random knapsack in expected polynomial time
In this paper, we present the first average-case analysis proving an expected polynomial running time for an exact algorithm for the 0/1 knapsack problem. In particular, we prove,...
René Beier, Berthold Vöcking
WCNC
2010
IEEE
13 years 11 months ago
Adaptive Multiple Relay Selection Scheme for Cooperative Wireless Networks
Abstract—In this paper, we propose an output-threshold multiple relay selection scheme for dual-hop multi-branch cooperative wireless networks. The proposed scheme selects the ï¬...
Gayan Amarasuriya, Masoud Ardakani, Chintha Tellam...
MFCS
2010
Springer
13 years 6 months ago
Qualitative Analysis of Partially-Observable Markov Decision Processes
We study observation-based strategies for partially-observable Markov decision processes (POMDPs) with parity objectives. An observationbased strategy relies on partial information...
Krishnendu Chatterjee, Laurent Doyen, Thomas A. He...
ISPD
2003
ACM
121views Hardware» more  ISPD 2003»
14 years 25 days ago
Optimality, scalability and stability study of partitioning and placement algorithms
This paper studies the optimality, scalability and stability of stateof-the-art partitioning and placement algorithms. We present algorithms to construct two classes of benchmarks...
Jason Cong, Michail Romesis, Min Xie