2430 search results - page 168 / 486 » Computing Tutte Polynomials |
132
Voted
CASES
2005
ACM
15 years 6 months ago
2005
ACM
Due to resource and power constraints, embedded processors often cannot afford dedicated floating-point units. For instance, the IBM PowerPC processor embedded in Xilinx Virtex-...
140
click to vote
ATMOS
2007
15 years 6 months ago
2007
The optimal track allocation problem (OPTRA) is to find, in a given railway network, a conflict free set of train routes of maximum value. We study two types of integer programmi...
152
click to vote
ADCM
2008
15 years 4 months ago
2008
Abstract. Signals with finite rate of innovation are those signals having finite degrees of freedom per unit of time that specify them. In this paper, we introduce a prototypical s...
161
click to vote
ACTA
2007
15 years 4 months ago
2007
Abstract We propose an exact algorithm for counting the models of propositional formulas in conjunctive normal form (CNF). Our algorithm is based on the detection of strong backdoo...
131
click to vote
SIAMNUM
2010
14 years 11 months ago
2010
A set XN of N points on the unit sphere is a spherical t-design if the average value of any polynomial of degree at most t over XN is equal to the average value of the polynomial o...