828 search results - page 47 / 166 » Bounded Hairpin Completion |
COMBINATORICS
2006
13 years 7 months ago
2006
A biclique is a complete bipartite subgraph of a graph. This paper investigates the fractional biclique cover number, bc(G), and the fractional biclique partition number, bp(G), o...
CORR
2011
Springer
13 years 2 months ago
2011
Springer
Abstract. We present a deep embedding of Bellantoni and Cook’s syntactic characterization of polytime functions. We prove formally that it is correct and complete with respect to...
QEST
2007
IEEE
14 years 1 months ago
2007
IEEE
Stochastic game logic (SGL) is a new temporal logic that combines features of alternating temporal logic (to formalize the individual views and cooperation and reaction facilities...
LICS
1999
IEEE
13 years 12 months ago
1999
IEEE
The problem of defining and checking a subtype relation between recursive types was studied in [3] for a first order type system, but for second order systems, which combine subty...
ICRA
1993
IEEE
13 years 11 months ago
1993
IEEE
This paper addresses the problem of numerically finding an optimal path for a robot with non-holonomic constraints. A car like robot, whose turning radius is lower bounded is cons...