2430 search results - page 223 / 486 » Computing Tutte Polynomials |
122
click to vote
JSCIC
2007
15 years 4 months ago
2007
Different time-stepping methods for a nodal high-order discontinuous Galerkin discretisation of the Maxwell equations are discussed. A comparison between the most popular choices o...
148
click to vote
WINE
2010
Springer
15 years 2 months ago
2010
Springer
We consider collusion in path procurement auctions, where payments are determined using the VCG mechanism. We show that collusion can increase the utility of the agents, and in som...
205
click to vote
WINE
2010
Springer
15 years 2 months ago
2010
Springer
We study Congestion Games with non-increasing cost functions (Cost Sharing Games) from a complexity perspective and resolve their computational hardness, which has been an open que...
130
click to vote
ALGORITHMICA
2010
15 years 4 months ago
2010
The notion of fixed-parameter approximation is introduced to investigate the approximability of optimization problems within the framework of fixed-parameter computation. This work...
150
click to vote
CASC
2010
Springer
15 years 1 months ago
2010
Springer
Abstract. Residue systems present a well-known way to reduce computation cost for symbolic computation. However most residue systems are implemented for integers or polynomials. Th...