2430 search results - page 258 / 486 » Computing Tutte Polynomials |
135
click to vote
SCA
2007
15 years 6 months ago
2007
Hinge-based bending models are widely used in the physically-based animation of cloth, thin plates and shells. We propose a hinge-based model that is simpler to implement, more ef...
142
click to vote
WICON
2008
15 years 5 months ago
2008
It is well known that the maximum weighted independent set (MWIS) problem is NP-complete. Moreover, optimal scheduling in wireless networks requires solving a MWIS problem. Conseq...
122
click to vote
FLAIRS
2006
15 years 5 months ago
2006
Sensitivity analysis of Markovian models amounts to computing the constants in polynomial functions of a parameter under study. To handle the computational complexity involved, we...
132
Voted
CORR
2010
Springer
15 years 4 months ago
2010
Springer
We conduct a computational analysis of partitions in additively separable hedonic games that satisfy standard criteria of fairness and optimality. We show that computing a partiti...
100
click to vote
CORR
2007
Springer
15 years 4 months ago
2007
Springer
A sup-interpretation is a tool which provides an upper bound on the size of a value computed by some symbol of a program. Supinterpretations have shown their interest to deal with...