197 search results - page 10 / 40 » Complexity of Max-SAT using stochastic algorithms |
AAMAS
2010
Springer
14 years 9 months ago
2010
Springer
POMDPs and their decentralized multiagent counterparts, DEC-POMDPs, offer a rich framework for sequential decision making under uncertainty. Their computational complexity, howeve...
STOC
2009
ACM
15 years 10 months ago
2009
ACM
Consider the edge-connectivity survivable network design problem: given a graph G = (V, E) with edge-costs, and edgeconnectivity requirements rij Z0 for every pair of vertices i,...
83
Voted
UAI
2008
14 years 11 months ago
2008
Bounded policy iteration is an approach to solving infinitehorizon POMDPs that represents policies as stochastic finitestate controllers and iteratively improves a controller by a...
INFOVIS
2002
IEEE
15 years 2 months ago
2002
IEEE
Many clustering and layout techniques have been used for structuring and visualising complex data. This paper is inspired by a number of such contemporary techniques and presents ...
104
click to vote
GLOBECOM
2007
IEEE
14 years 11 months ago
2007
IEEE
Abstract— In this paper, we propose a resource allocation algorithm for ergodic weighted-sum rate maximization in downlink OFDMA systems. In contrast to most previous research tha...