In this paper, we consider the energy-efficient resource allocation that minimizes a general cost function of average user powers in wireless networks. A class of so-called -fair c...
Xin Wang, Di Wang, Hanqi Zhuang, Salvatore D. Morg...
: Various algorithms have been proposed for the determination of the optimum paths in line networks. Moving in space is a far more complex problem, where research has been scarce. ...
A flow on a directed network is said to be confluent if the flow uses at most one outgoing arc at each node. Confluent flows arise naturally from destination-based routing. We stud...
We implement a self-organized flocking behavior in a group of mobile robots and analyze its transition from an aligned state to an unaligned state. We briefly describe the robot an...
The enormous number of questions needed to acquire a full preference model when the size of the outcome space is large forces us to work with partial models that approximate the u...