: We consider a game played between a hider, who hides a static object in one of several possible positions in a bounded planar region, and a searcher who wishes to reach the objec...
Consider the task of a mobile robot autonomously navigating through an environment while detecting and mapping objects of interest using a noisy object detector. The robot must re...
Abstract. We present three algorithms to calculate Φn(z), the nth cyclotomic polynomial. The first algorithm calculates Φn(z) by a series of polynomial divisions, which we perfo...
In pay-per click sponsored search auctions which are cur-
rently extensively used by search engines, the auction for
a keyword involves a certain number of advertisers (say k)
c...
The most important and interesting of the computing challenges we are facing are those that involve the problems and opportunities afforded by massive decentralization and disinte...