1447 search results - page 107 / 290 » Graphs and Path Equilibria |
139
click to vote
SAGT
2010
Springer
15 years 2 months ago
2010
Springer
Abstract. We consider network congestion games in which a finite number of non-cooperative users select paths. The aim is to mitigate the inefficiency caused by the selfish users...
135
click to vote
ESA
2006
Springer
15 years 8 months ago
2006
Springer
Abstract. Zigzag pocket machining (or 2D-milling) plays an important role in the manufacturing industry. The objective is to minimize the number of tool retractions in the zigzag m...
124
click to vote
HICSS
2008
IEEE
15 years 10 months ago
2008
IEEE
While executing a process, many decisions are taken at its various decision points for selecting paths. There is a need for understanding and analyzing on various paths that emana...
138
click to vote
ACSAC
2003
IEEE
15 years 9 months ago
2003
IEEE
In-depth analysis of network security vulnerability must consider attacker exploits not just in isolation, but also in combination. The general approach to this problem is to comp...
129
click to vote
WG
2009
Springer
15 years 10 months ago
2009
Springer
We consider the NP-hard problem of finding a spanning tree with a maximum number of internal vertices. This problem is a generalization of the famous Hamiltonian Path problem. Our...