1522 search results - page 75 / 305 » On the Complexity of Several Haplotyping Problems |
JAIR
2008
13 years 7 months ago
2008
Probabilistic planning problems are typically modeled as a Markov Decision Process (MDP). MDPs, while an otherwise expressive model, allow only for sequential, non-durative action...
COMPGEOM
2004
ACM
14 years 1 months ago
2004
ACM
Let P be a set of n points in general position in the plane. Let Xk(P ) denote the number of empty convex k-gons determined by P. We derive, using elementary proof techniques, sev...
FSTTCS
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. We prove several results about the average-case complexity of problems in the Polynomial Hierarchy (PH). We give a connection among average-case, worst-case, and non-unif...
ATAL
2008
Springer
13 years 9 months ago
2008
Springer
We consider Coalitional Skill Games (CSGs), a simple model of cooperation among agents. This is a restricted form of coalitional games, where each agent has a set of skills that a...
ICDM
2008
IEEE
14 years 2 months ago
2008
IEEE
Social interactions that occur regularly typically correspond to significant yet often infrequent and hard to detect interaction patterns. To identify such regular behavior, we p...