Recent algorithmic and theoretical advances in reinforcement learning (RL) have attracted widespread interest. RL algorithmshave appeared that approximatedynamic programming on an ...
We present a new algorithm for computing the structure of a finite abelian group, which has to store only a fixed, small number of group elements, independent of the group order....
Exploratory Learning Environments (ELEs) allow learners to approach a problem in different ways; they are particularly suitable for ill-defined problems where knowledge is less str...
In this work, we study the NP-hard problem of maximizing lightpath reliability in optical mesh networks against simultaneous failures of multiple fiber links. The fiber links belo...
Shengli Yuan, William Waller, Ermelinda DeLa Vi&nt...
In this paper, we present a new solution to the problem of matching groups of people across multiple nonoverlapping cameras. Similar to the problem of matching individuals across ...