2430 search results - page 279 / 486 » Computing Tutte Polynomials |
SODA
1990
ACM
15 years 5 months ago
1990
ACM
Let O be an order of an algebraic number field. It was shown by Ge that given a factorization of an O-ideal a into a product of O-ideals it is possible to compute in polynomial tim...
160
click to vote
CIBCB
2009
IEEE
15 years 5 months ago
2009
IEEE
Although Ordinary Differential Equations (ODEs) have been used to model Genetic Regulatory Networks (GRNs) in many previous works, their steady-state behaviors are not well studied...
156
click to vote
CSC
2009
15 years 5 months ago
2009
- The Traveling Salesman Problem (TSP) is perhaps the most famous optimization problem in the set NP-hard. Many problems that are natural applications in computer science and engin...
130
Voted
DCG
2010
15 years 3 months ago
2010
We consider the problem of computing minimum geometric hitting sets in which, given a set of geometric objects and a set of points, the goal is to compute the smallest subset of p...
129
click to vote
AMAI
2006
Springer
15 years 3 months ago
2006
Springer
In this paper we study multi issue alternating-offers bargaining in a perfect information finite horizon setting, we determine the pertinent subgame perfect equilibrium, and we pro...