2430 search results - page 427 / 486 » Computing Tutte Polynomials |
108
click to vote
RECOMB
1997
Springer
15 years 6 months ago
1997
Springer
Multiple sequence alignment is an important problem in computational biology. We study the Maximum Trace formulation introduced by Kececioglu [?]. We first phrase the problem in ...
114
click to vote
ICDT
2010
ACM
15 years 6 months ago
2010
ACM
Several computational problems in phylogenetic reconstruction can be formulated as restrictions of the following general problem: given a formula in conjunctive normal form where ...
148
click to vote
FSTTCS
1992
Springer
15 years 6 months ago
1992
Springer
Levin introduced an average-case complexity measure, based on a notion of \polynomialon average," and de ned \average-case polynomial-time many-one reducibility" amongra...
130
click to vote
DCOSS
2006
Springer
15 years 5 months ago
2006
Springer
We develop algorithms for finding the minimum energy transmission schedule for duty-cycle and rate constrained wireless sensor nodes transmitting over an interference channel. Sinc...
125
click to vote
ATAL
2010
Springer
15 years 3 months ago
2010
Springer
Planning how to interact against bounded memory and unbounded memory learning opponents needs different treatment. Thus far, however, work in this area has shown how to design pla...