Now showing items 1-4 of 4

    • Algorithms for On-Line Navigation 

      Kleinberg, Jon M. (Cornell University, 1992-11)
      We consider a number of problems faced by a robot trying to navigate inside a simple polygon. Such problems are "on-line"g in the sense that the robot does not have access to the map of the polygon; it must make decisions ...
    • A Lower Bound for Two-Server Balancing Algorithms 

      Kleinberg, Jon M. (Cornell University, 1993-05)
      We consider the class of balancing algorithms for two servers. Such algorithms have appeared in a number of the early papers on this problem; they are so named because they seek to "balance" the distance travelled evenly ...
    • On Invariants of Sets of Points or Line Segments Under Projection 

      Huttenlocher, Daniel P.; Kleinberg, Jon M. (Cornell University, 1992-07)
      We consider the problem of computing invariant functions of the image of a set of points or line segments in $\Re^3$ under projection. Such functions are in principle useful for machine vision systems, because they allow ...
    • Resource Bounds and Combinations of Consensus Objects 

      Kleinberg, Jon M.; Mullainathan, Sendhil (Cornell University, 1993-05)
      The shared-memory model of computation typically provides processes with an arbitrary number of copies of the available object types; yet a simple argument shows that any consensus protocol can only make use of some ...