88 citations · 277 across the 49 of their papers we have counts for
5 papers · 2 filters
Communication-Aware Processor Allocation for Supercomputers
Michael A. Bender, David P. Bunde, Erik D. Demaine +4
This paper gives processor-allocation algorithms for minimizing the average number of communication hops between the assigned processors for grid architectures, in the presence of…
Online Searching with Turn Cost
Erik D. Demaine, Sandor P. Fekete, Shmuel Gal
We consider the problem of searching for an object on a line at an unknown distance OPT from the original position of the searcher, in the presence of a cost of d for each time the…
Neighborhood-Based Topology Recognition in Sensor Networks
Sandor P. Fekete, Alexander Kroeller, Dennis Pfisterer +2
We consider a crucial aspect of self-organization of a sensor network consisting of a large set of simple sensor nodes with no location hardware and only very limited communication…
A General Framework for Bounds for Higher-Dimensional Orthogonal Packing Problems
Sandor P. Fekete, Joerg Schepers
Higher-dimensional orthogonal packing problems have a wide range of practical applications, including packing, cutting, and scheduling. In the context of a branch-and-bound framewo…
The Freeze-Tag Problem: How to Wake Up a Swarm of Robots
Esther M. Arkin, Michael A. Bender, Sandor P. Fekete +2
An optimization problem that naturally arises in the study of swarm robotics is the Freeze-Tag Problem (FTP) of how to awaken a set of ``asleep'' robots, by having an awakened robo…