We present a new algorithm to measure domain-specific readability. It iteratively computes the readability of domainspecific resources based on the difficulty of domain-specific c...
This video illustrates an algorithm for computing a maximum number of disjoint paths for unit disks moving among a set of dynamic obstacles in the plane. The problem is motivated ...
Joondong Kim, Joseph S. B. Mitchell, Valentin Poli...
The paper proposes an approach to EUD focusing on communities: on the one hand, users are considered as a community of cooperating actors; on the other hand, applications and devi...
Biodiversity databases have recently become widely available to the public and to other researchers. To retrieve information from these resources, users must understand the underl...
Bongshin Lee, Cynthia Sims Parr, Dana Campbell, Be...
Partially Observable Markov Decision Process (POMDP) is a popular framework for planning under uncertainty in partially observable domains. Yet, the POMDP model is riskneutral in ...