Sciweavers

109 search results - page 22 / 22
» Geometric Duality in Multiple Objective Linear Programming
Sort
View
NHM
2010
87views more  NHM 2010»
13 years 23 days ago
The coolest path problem
We introduce the coolest path problem, which is a mixture of two well-known problems from distinct mathematical fields. One of them is the shortest path problem from combinatorial ...
Martin Frank, Armin Fügenschuh, Michael Herty...
IOR
2007
89views more  IOR 2007»
13 years 5 months ago
Fast, Fair, and Efficient Flows in Networks
Abstract. We study the problem of minimizing the maximum latency of flows in networks with congestion. We show that this problem is NP-hard, even when all arc latency functions ar...
José R. Correa, Andreas S. Schulz, Nicol&aa...
CN
2006
112views more  CN 2006»
13 years 6 months ago
Optimal server allocations for streaming multimedia applications on the Internet
In this paper, we address the server selection problem for streaming applications on the Internet. The architecture we consider is similar to the content distribution networks con...
Padmavathi Mundur, Poorva Arankalle
RSS
2007
119views Robotics» more  RSS 2007»
13 years 7 months ago
Emergent Task Allocation for Mobile Robots
— Multi-robot systems require efficient and accurate planning in order to perform mission-critical tasks. However, algorithms that find the optimal solution are usually computa...
Nuzhet Atay, O. Burçhan Bayazit