197 search results - page 10 / 40 » Complexity of Max-SAT using stochastic algorithms |
137
click to vote
AAMAS
2010
Springer
15 years 4 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...
140
click to vote
STOC
2009
ACM
16 years 4 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,...
130
click to vote
UAI
2008
15 years 5 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...
119
click to vote
INFOVIS
2002
IEEE
15 years 8 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 ...
158
click to vote
GLOBECOM
2007
IEEE
15 years 5 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...