Sciweavers

681 search results - page 64 / 137
» General Polynomial Time Decomposition Algorithms
Sort
View
BMCBI
2004
151views more  BMCBI 2004»
15 years 10 days ago
Design, implementation and evaluation of a practical pseudoknot folding algorithm based on thermodynamics
Background: The general problem of RNA secondary structure prediction under the widely used thermodynamic model is known to be NP-complete when the structures considered include a...
Jens Reeder, Robert Giegerich
98
Voted
SIGECOM
2010
ACM
165views ECommerce» more  SIGECOM 2010»
15 years 5 months ago
Computing optimal strategies to commit to in extensive-form games
Computing optimal strategies to commit to in general normal-form or Bayesian games is a topic that has recently been gaining attention, in part due to the application of such algo...
Joshua Letchford, Vincent Conitzer
102
Voted
FOCS
1998
IEEE
15 years 4 months ago
Unsatisfiable Systems of Equations, Over a Finite Field
The properties of any system of k simultaneous equations in n variables over GF(q), are studied, with a particular emphasis on unsatisfiable systems. A general formula for the num...
Alan R. Woods
ISAAC
2009
Springer
113views Algorithms» more  ISAAC 2009»
15 years 5 months ago
On Shortest Disjoint Paths in Planar Graphs
For a graph G and a collection of vertex pairs {(s1, t1), . . . , (sk, tk)}, the k disjoint paths problem is to find k vertex-disjoint paths P1, . . . , Pk, where Pi is a path fr...
Yusuke Kobayashi, Christian Sommer 0002
COCOON
1999
Springer
15 years 4 months ago
Area Minimization for Grid Visibility Representation of Hierarchically Planar Graphs
Abstract. Hierarchical graphs are an important class of graphs for modelling many real applications in software and information visualization. In this paper, we shall investigate t...
Xuemin Lin, Peter Eades