2430 search results - page 175 / 486 » Computing Tutte Polynomials |
159
click to vote
AAMAS
2012
Springer
14 years 13 days ago
2012
Springer
In multiagent settings where agents have different preferences, preference aggregation can be an important issue. Voting is a general method to aggregate preferences. We consider ...
154
click to vote
RECOMB
2007
Springer
16 years 5 months ago
2007
Springer
The problem of Sorting signed permutations by reversals is a well studied problem in computational biology. The first polynomial time algorithm was presented by Hannenhalli and Pev...
122
Voted
DAC
2009
ACM
15 years 11 months ago
2009
ACM
In this paper we present a continuous surface model to describe the interconnect geometric variation, which improves the currently used model for better accuracy while not increas...
135
click to vote
CASC
2007
Springer
15 years 11 months ago
2007
Springer
We introduce the concept of comprehensive triangular decomposition (CTD) for a parametric polynomial system F with coefficients in a field. In broad words, this is a finite part...
128
click to vote
IANDC
2010
15 years 3 months ago
2010
Simulation preorder/equivalence and bisimulation equivalence are the most commonly used equivalences in concurrency theory. Their standard definitions are often called strong sim...