- For an iterative process to be parallelized, the operations that comprise the process must be organized into a correct schedule that will allow the hardware to compute the task. ...
We present a heuristic approach to the geometric motion planning problem with the aim to quickly solve intuitively simple problems. It is based on a divide-and-conquer path search...
Query processing techniques for XML data have focused mainly on tree-pattern queries (TPQs). However, the need for querying XML data sources whose structure is very complex or not...
Boolean linear programs (BLPs) are ubiquitous in AI. Satisfiability testing, planning with resource constraints, and winner determination in combinatorial auctions are all example...
Dale Schuurmans, Finnegan Southey, Robert C. Holte
The problem of broadcasting a message through a network is considered. The objective is to minimize the number of time steps necessary to complete the broadcast. This problem is k...
Cory J. Hoelting, Dale A. Schoenefeld, Roger L. Wa...