3049 search results - page 227 / 610 » On the Convergence of Bound Optimization Algorithms |
154
click to vote
AIPS
2003
15 years 8 months ago
2003
We develop a hierarchical approach to planning for partially observable Markov decision processes (POMDPs) in which a policy is represented as a hierarchical finite-state control...
207
click to vote
GLOBECOM
2010
IEEE
15 years 4 months ago
2010
IEEE
Abstract-- We study joint rate control and resource allocation with QoS provisioning that maximizes the total utility of secondary users in cognitive radio networks. We formulate a...
152
click to vote
PR
2008
15 years 6 months ago
2008
Prototype selection problem consists of reducing the size of databases by removing samples that are considered noisy or not influential on nearest neighbour classification tasks. ...
170
click to vote
SODA
2004
ACM
15 years 8 months ago
2004
ACM
We study vertex colorings of the square G2 of an outerplanar graph G. We find the optimal bound of the inductiveness, chromatic number and the clique number of G2 as a function of...
194
click to vote
COLOGNETWENTE
2010
15 years 5 months ago
2010
We present an algorithm for the independent set problem on semi-random graphs, which are generated as follows: An adversary chooses an n-vertex graph, and then each edge is flipp...