Round-based games are an instance of discrete planning problems. Some of the best contemporary game tree search algorithms use random roll-outs as data. Relying on a good policy, ...
There are many difficult challenges ahead in the design of an energy-efficient communication stack for wireless sensor networks. Due to the severe sensor node constraints, protocol...
The building identification (BID) problem is based on a process that uses publicly available information to automatically assign addresses to buildings in satellite imagery. In pr...
Martin Michalowski, Craig A. Knoblock, Kenneth M. ...
Many approaches to software verification are currently semi-automatic: a human must provide key logical insights — e.g., loop invariants, class invariants, and frame axioms tha...
After two decades of effort, type inference for dynamically typed languages scales to programs of a few tens of thousands of lines of code, but no further. For larger programs, th...