Results 1  10
of
8,399
Planning Algorithms
, 2004
"... This book presents a unified treatment of many different kinds of planning algorithms. The subject lies at the crossroads between robotics, control theory, artificial intelligence, algorithms, and computer graphics. The particular subjects covered include motion planning, discrete planning, planning ..."
Abstract

Cited by 1108 (51 self)
 Add to MetaCart
This book presents a unified treatment of many different kinds of planning algorithms. The subject lies at the crossroads between robotics, control theory, artificial intelligence, algorithms, and computer graphics. The particular subjects covered include motion planning, discrete planning, planning under uncertainty, sensorbased planning, visibility, decisiontheoretic planning, game theory, information spaces, reinforcement learning, nonlinear systems, trajectory planning, nonholonomic planning, and kinodynamic planning.
SIS: A System for Sequential Circuit Synthesis
, 1992
"... SIS is an interactive tool for synthesis and optimization of sequential circuits. Given a state transition table, a signal transition graph, or a logiclevel description of a sequential circuit, it produces an optimized netlist in the target technology while preserving the sequential inputoutput b ..."
Abstract

Cited by 514 (41 self)
 Add to MetaCart
SIS is an interactive tool for synthesis and optimization of sequential circuits. Given a state transition table, a signal transition graph, or a logiclevel description of a sequential circuit, it produces an optimized netlist in the target technology while preserving the sequential inputoutput behavior. Many different programs and algorithms have been integrated into SIS, allowing the user to choose among a variety of techniques at each stage of the process. It is built on top of MISII [5] and includes all (combinational) optimization techniques therein as well as many enhancements. SIS serves as both a framework within which various algorithms can be tested and compared, and as a tool for automatic synthesis and optimization of sequential circuits. This paper provides an overview of SIS. The first part contains descriptions of the input specification, STG (state transition graph) manipulation, new logic optimization and verification algorithms, ASTG (asynchronous signal transition graph) manipulation, and synthesis for PGA’s (programmable gate arrays). The second part contains a tutorial example illustrating the design process using SIS.
2007 . Phaser crystallographic software
 658 – 674
"... Phaser is a program for phasing macromolecular crystal structures by both molecular replacement and experimental phasing methods. The novel phasing algorithms implemented in Phaser have been developed using maximum likelihood and multivariate statistics. For molecular replacement, the new algorithms ..."
Abstract

Cited by 401 (0 self)
 Add to MetaCart
Phaser is a program for phasing macromolecular crystal structures by both molecular replacement and experimental phasing methods. The novel phasing algorithms implemented in Phaser have been developed using maximum likelihood and multivariate statistics. For molecular replacement, the new
Mesh Generation And Optimal Triangulation
, 1992
"... We survey the computational geometry relevant to finite element mesh generation. We especially focus on optimal triangulations of geometric domains in two and threedimensions. An optimal triangulation is a partition of the domain into triangles or tetrahedra, that is best according to some cri ..."
Abstract

Cited by 213 (7 self)
 Add to MetaCart
criterion that measures the size, shape, or number of triangles. We discuss algorithms both for the optimization of triangulations on a fixed set of vertices and for the placement of new vertices (Steiner points). We briefly survey the heuristic algorithms used in some practical mesh generators.
SecondOrder Cone Programming
 MATHEMATICAL PROGRAMMING
, 2001
"... In this paper we survey the second order cone programming problem (SOCP). First we present several applications of the problem in various areas of engineering and robust optimization problems. We also give examples of optimization problems that can be cast as SOCPs. Next we review an algebraic struc ..."
Abstract

Cited by 231 (11 self)
 Add to MetaCart
In this paper we survey the second order cone programming problem (SOCP). First we present several applications of the problem in various areas of engineering and robust optimization problems. We also give examples of optimization problems that can be cast as SOCPs. Next we review an algebraic structure that is connected to SOCP. This algebra is a special case of a Euclidean Jordan algebra. After presenting duality theory, complementary slackness conditions, and definitions and algebraic characterizations of primal and dual nondegeneracy and strict complementarity we review the logarithmic barrier function for the SOCP problem and survey the pathfollowing interior point algorithms for it. Next we examine numerically stable methods for solving the interior point methods and study ways that sparsity in the input data can be exploited. Finally we give some current and future research direction in SOCP.
Torsion Angle Dynamics for NMR Structure Calculation with the New Program DYANA
, 1997
"... The new program DYANA... ..."
Provably Good Mesh Generation
 J. Comput. Syst. Sci
, 1990
"... We study several versions of the problem of generating triangular meshes for finite element methods. We show how to triangulate a planar point set or polygonally bounded domain with triangles of bounded aspect ratio; how to triangulate a planar point set with triangles having no obtuse angles; how t ..."
Abstract

Cited by 223 (12 self)
 Add to MetaCart
We study several versions of the problem of generating triangular meshes for finite element methods. We show how to triangulate a planar point set or polygonally bounded domain with triangles of bounded aspect ratio; how to triangulate a planar point set with triangles having no obtuse angles; how to triangulate a point set in arbitrary dimension with simplices of bounded aspect ratio; and how to produce a linearsize Delaunay triangulation of a multidimensional point set by adding a linear number of extra points. All our triangulations have size (number of triangles) within a constant factor of optimal, and run in optimal time O(n log n+k) with input of size n and output of size k. No previous work on mesh generation simultaneously guarantees wellshaped elements and small total size. 1. Introduction Geometric partitioning problems ask for the decomposition of a geometric input into simpler objects. These problems are fundamental in many areas, such as solid modeling, computeraided ...
Solving group Steiner problems as Steiner Problems
, 2004
"... The generalized spanning tree or group Steiner problem (GSP) is a generalization of the Steiner problem in graphs (SPG): one requires a tree spanning (at least) one vertex of each subset, given in a family of vertex subsets, while minimizing the sum of the corresponding edge costs. Specialized solut ..."
Abstract

Cited by 9 (0 self)
 Add to MetaCart
The generalized spanning tree or group Steiner problem (GSP) is a generalization of the Steiner problem in graphs (SPG): one requires a tree spanning (at least) one vertex of each subset, given in a family of vertex subsets, while minimizing the sum of the corresponding edge costs. Specialized
Results 1  10
of
8,399