Results 1  10
of
223
Strip Graphs: Recognition and Scheduling
 WG 2006
, 2006
"... We consider the class of strip graphs, a generalization of interval graphs. Intervals are assigned to rows such that two vertices have an edge between them if either their intervals intersect or they belong to the same row. We show that recognition of the class of strip graphs is NPcomplete even if ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
We consider the class of strip graphs, a generalization of interval graphs. Intervals are assigned to rows such that two vertices have an edge between them if either their intervals intersect or they belong to the same row. We show that recognition of the class of strip graphs is NPcomplete even
Flow Polynomials and their Asymptotic Limits for Lattice Strip Graphs
"... We present exact calculations of flow polynomials F(G,q) for lattice strips of various fixed widths Ly and arbitrarily great lengths Lx, with several different boundary conditions. Square, honeycomb, and triangular lattice strips are considered. We introduce the notion of flows per face fl in the in ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
strip graphs with periodic (or twisted periodic) longitudinal boundary conditions, and compact for strips with free longitudinal boundary conditions. We also find the interesting feature that, aside from the trivial case Ly = 1, the maximal point, qcf, where B crosses the real axis, is universal
Fast Planning Through Planning Graph Analysis
 ARTIFICIAL INTELLIGENCE
, 1995
"... We introduce a new approach to planning in STRIPSlike domains based on constructing and analyzing a compact structure we call a Planning Graph. We describe a new planner, Graphplan, that uses this paradigm. Graphplan always returns a shortest possible partialorder plan, or states that no valid pla ..."
Abstract

Cited by 1171 (3 self)
 Add to MetaCart
We introduce a new approach to planning in STRIPSlike domains based on constructing and analyzing a compact structure we call a Planning Graph. We describe a new planner, Graphplan, that uses this paradigm. Graphplan always returns a shortest possible partialorder plan, or states that no valid
Dictionary of protein secondary structure: pattern recognition of hydrogenbonded and geometrical features
, 1983
"... For a successful analysis of the relation between amino acid sequence and protein structure, an unambiguous and physically meaningful definition of secondary structure is essential. We have developed a set of simple and physically motivated criteria for secondary structure, programmed as a patternr ..."
Abstract

Cited by 2096 (5 self)
 Add to MetaCart
. ” Solvent “exposure ” is given as the number of water molecules in possible contact with a residue. The end result is a compilation of the primary structure, including SS bonds, secondary structure, and solvent exposure of 62 different globular proteins. The presentation is in linear form: strip graphs
Potts Model Partition Functions for SelfDual Families of Strip Graphs
, 2001
"... We consider the qstate Potts model on families of selfdual strip graphs GD of the square lattice of width Ly and arbitrarily great length Lx, with periodic longitudinal boundary conditions. The general partition function Z and the T = 0 antiferromagnetic special case P (chromatic polynomial) have ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
We consider the qstate Potts model on families of selfdual strip graphs GD of the square lattice of width Ly and arbitrarily great length Lx, with periodic longitudinal boundary conditions. The general partition function Z and the T = 0 antiferromagnetic special case P (chromatic polynomial) have
Unifying SATbased and Graphbased Planning
 In IJCAI
, 1999
"... The Blackbox planning system unifies the planning as satisfiability framework (Kautz and Selman 1992, 1996) with the plan graph approach to STRIPS planning (Blum and Furst 1995). We show that STRIPS problems can be directly translated into SAT and efficiently solved using new randomized systemati ..."
Abstract

Cited by 294 (15 self)
 Add to MetaCart
The Blackbox planning system unifies the planning as satisfiability framework (Kautz and Selman 1992, 1996) with the plan graph approach to STRIPS planning (Blum and Furst 1995). We show that STRIPS problems can be directly translated into SAT and efficiently solved using new randomized
Graph Search and STRIPS Planning
, 1992
"... Introduction to Graph Search Consider the eight puzzle show in figure 1. This puzzle is played on a three by three square board containing eight tiles and an empty square. Any tile which is next to the empty square can be slid into the empty square leaving an opening (empty square) in the place tha ..."
Abstract
 Add to MetaCart
Introduction to Graph Search Consider the eight puzzle show in figure 1. This puzzle is played on a three by three square board containing eight tiles and an empty square. Any tile which is next to the empty square can be slid into the empty square leaving an opening (empty square) in the place
A Planning Heuristic Based on Causal Graph Analysis
"... In recent years, heuristic search methods for classical planning have achieved remarkable results. Their most successful representative, the FF algorithm, performs well over a wide spectrum of planning domains and still sets the state of the art for STRIPS planning. However, there are some planning ..."
Abstract

Cited by 119 (18 self)
 Add to MetaCart
In recent years, heuristic search methods for classical planning have achieved remarkable results. Their most successful representative, the FF algorithm, performs well over a wide spectrum of planning domains and still sets the state of the art for STRIPS planning. However, there are some planning
CONSTANT MEAN CURVATURE GRAPHS IN A STRIP OF R²
, 2002
"... We consider the Dirichlet problemfor the constant mean curvature surface equation on domains of an infinite strip of the plane. We give sufficient conditions for the existence of smooth solutions provided that the boundary satisfies a certain exterior circle condition. A feature of the work is the u ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
We consider the Dirichlet problemfor the constant mean curvature surface equation on domains of an infinite strip of the plane. We give sufficient conditions for the existence of smooth solutions provided that the boundary satisfies a certain exterior circle condition. A feature of the work
Results 1  10
of
223