24 search results - page 3 / 5 » What makes some POMDP problems easy to approximate |
RECOMB
2010
Springer
14 years 5 days ago
2010
Springer
A phase transition is taking place today. The amount of data generated by genome resequencing technologies is so large that in some cases it is now less expensive to repeat the exp...
IPL
2008
13 years 5 months ago
2008
As part of the efforts put in understanding the intricacies of the k-colorability problem, different distributions over k-colorable graphs were analyzed. While the problem is notor...
SPAA
2004
ACM
13 years 10 months ago
2004
ACM
Given a general graph G, a fundamental problem is to find a spanning tree H that best approximates G by some measure. Often this measure is some combination of the congestion and...
WSC
1997
13 years 6 months ago
1997
In response to the expressed needs of MedModel users, PROMODEL Corporation has made substantial improvements in its MedModel healthcare simulation software. Beginning with its inc...
AIL
2004
13 years 5 months ago
2004
The paper identi es some of the problems with legal systems and outlines the potential of AI technology for overcoming them. For expository purposes, this outline is based on a si...