2796 search results - page 289 / 560 » The coolest path problem |
169
click to vote
ICMCS
2005
IEEE
16 years 7 days ago
2005
IEEE
We consider the problem of packetizing a variable length coded Markov sequence into fixed length packets, while being protected by variable rate channel code. Given the total tra...
178
click to vote
ICPP
2005
IEEE
16 years 7 days ago
2005
IEEE
In this paper we introduce a new algorithm for computing near optimal schedules for task graph problems. In contrast to conventional approaches for solving those scheduling proble...
168
click to vote
INFOCOM
2005
IEEE
16 years 7 days ago
2005
IEEE
— We consider the problem of scheduling a sequence of packets over a linear network, where every packet has a source and a target, as well as a release time and a deadline by whi...
181
click to vote
GECCO
2005
Springer
16 years 4 days ago
2005
Springer
Genetic Algorithms (GAs) can efficiently produce high quality results for hard combinatorial real world problems such as the Vehicle Routing Problem (VRP). Genetic Vehicle Represe...
175
click to vote
QOSIP
2005
Springer
16 years 3 days ago
2005
Springer
In this paper, we present a novel approach to the congestion control and resource allocation problem of elastic and real-time traffic in telecommunication networks. With the concep...