2421 search results - page 393 / 485 » Approximate Flow-Aware Networking |
115
click to vote
GLOBECOM
2009
IEEE
15 years 6 months ago
2009
IEEE
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...
116
click to vote
COSIT
1995
Springer
15 years 6 months ago
1995
Springer
: 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. ...
122
click to vote
CIAC
2010
Springer
15 years 5 months ago
2010
Springer
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...
105
click to vote
ANTSW
2008
Springer
15 years 4 months ago
2008
Springer
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...
120
click to vote
AIA
2007
15 years 3 months ago
2007
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...