2926 search results - page 138 / 586 » Partially Optimal Routing |
121
click to vote
ICDE
2006
IEEE
15 years 9 months ago
2006
IEEE
Although the ant metaphor has been successfully applied to routing of data packets both in wireless and fixed networks, little is yet known about its applicability to the task of...
131
click to vote
ATMOS
2010
15 years 2 months ago
2010
The Team Orienteering Problem is a routing problem on a graph with durations associated to the arcs and profits assigned to visiting the vertices. A fixed number of identical ve...
125
click to vote
GECCO
2009
Springer
15 years 7 months ago
2009
Springer
The Vehicle Routing Problem’s main objective is to find the lowest-cost set of routes to deliver goods to customers, which have a service time window, using a fleet of identic...
122
click to vote
CN
2007
15 years 3 months ago
2007
A practical and robust inter-domain marking scheme for IP traceback is proposed. We first identify six drawbacks of Probabilistic Packet Marking (PPM), and then contrive a synerg...
129
Voted
FSTTCS
2009
Springer
15 years 9 months ago
2009
Springer
Partial Cover problems are optimization versions of fundamental and well studied problems like Vertex Cover and Dominating Set. Here one is interested in covering (or dominating) ...