3875 search results - page 23 / 775 » Approximation Algorithms for the Max-coloring Problem |
IPL
2007
13 years 7 months ago
2007
The disk dimension of a planar graph G is the least number k for which G embeds in the plane minus k open disks, with every vertex on the boundary of some disk. Useful properties ...
IJCAI
2001
13 years 9 months ago
2001
Although a partially observable Markov decision process (POMDP) provides an appealing model for problems of planning under uncertainty, exact algorithms for POMDPs are intractable...
ORL
2006
13 years 7 months ago
2006
We give a (1 - 1/e)-approximation algorithm for the Max-Profit Generalized Assignment Problem (Max-GAP) with fixed profits when the profit (but not necessarily the size) of every ...
ESANN
2000
13 years 9 months ago
2000
Iterative algorithm based on quantum tunneling is proposed by making use of mean- eld approximation. W e apply our method to the problem of BW image reconstruction (IR). Its perfor...
ICA
2012
Springer
12 years 3 months ago
2012
Springer
In this contribution, new online EM algorithms are proposed to perform inference in general hidden Markov models. These algorithms update the parameter at some deterministic times ...