Results 1  10
of
455
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
An Implementation Of Karmarkar's Algorithm For Linear Programming
 Mathematical Programming
, 1986
"... . This paper describes the implementation of power series dual affine scaling variants of Karmarkar's algorithm for linear programming. Based on a continuous version of Karmarkar's algorithm, two variants resulting from first and second order approximations of the continuous trajectory are ..."
Abstract

Cited by 74 (4 self)
 Add to MetaCart
columns, are discussed. The code is tested on several standard linear programming problems and compares favorably with the simplex code MINOS 4.0. 1. INTRODUCTION We describe in this paper a family of interior point power series affine scaling algorithms based on the linear programming algorithm presented
A finite element method for domain decomposition with nonmatching grids
 ESAIM: Mathematical Modeling and Numerical Analysis
"... Abstract. In this note, we propose and analyse a method for handling interfaces between nonmatching grids based on an approach suggested by Nitsche (1971) for the approximation of Dirichlet boundary conditions. The exposition is limited to selfadjoint elliptic problems, using Poisson’s equation a ..."
Abstract

Cited by 72 (11 self)
 Add to MetaCart
Abstract. In this note, we propose and analyse a method for handling interfaces between nonmatching grids based on an approach suggested by Nitsche (1971) for the approximation of Dirichlet boundary conditions. The exposition is limited to selfadjoint elliptic problems, using Poisson’s equa
Algorithms Contents
, 2014
"... This chapter aims to supplement the book Convex Optimization Theory, Athena Scientific, 2009 with material on convex optimization algorithms. ..."
Abstract
 Add to MetaCart
This chapter aims to supplement the book Convex Optimization Theory, Athena Scientific, 2009 with material on convex optimization algorithms.
Local and parallel finite element algorithms based on twogrid discretizations
 Math. Comput
"... Abstract. A number of new local and parallel discretization and adaptive finite element algorithms are proposed and analyzed in this paper for elliptic boundary value problems. These algorithms are motivated by the observation that, for a solution to some elliptic problems, low frequency components ..."
Abstract

Cited by 37 (13 self)
 Add to MetaCart
Abstract. A number of new local and parallel discretization and adaptive finite element algorithms are proposed and analyzed in this paper for elliptic boundary value problems. These algorithms are motivated by the observation that, for a solution to some elliptic problems, low frequency components
unknown title
, 1999
"... In this paper, we present an auxiliary algorithm, in terms of the speed of obtaining the optimal solution, that is e!ective in helping the simplex method for commencing a better initial basic feasible solution. The idea of choosing a direction towards an optimal point presented in this paper is new ..."
Abstract
 Add to MetaCart
In this paper, we present an auxiliary algorithm, in terms of the speed of obtaining the optimal solution, that is e!ective in helping the simplex method for commencing a better initial basic feasible solution. The idea of choosing a direction towards an optimal point presented in this paper is new
Genetic Algorithms In Control Systems Engineering
 In Proceedings of the 12th IFAC World Congress
, 2001
"... Genetic algorithms (GAs) are global, parallel, stochastic search methods, founded on Darwinian evolutionary principles. Many variations exist, including genetic programming and multiobj ective algorithms. During the last decade GAs have been applied in a variety of areas, with varying degrees of suc ..."
Abstract

Cited by 27 (2 self)
 Add to MetaCart
Genetic algorithms (GAs) are global, parallel, stochastic search methods, founded on Darwinian evolutionary principles. Many variations exist, including genetic programming and multiobj ective algorithms. During the last decade GAs have been applied in a variety of areas, with varying degrees
An efficient linear programming algorithm for combined heat and power production
, 2003
"... Combined heat and power (CHP) production is an increasingly important energy production technology. CHP production is usually applied in back pressure plants, where the heat and power generation follows a joint characteristic. A CHP system may also comprise separate heat and power production facilit ..."
Abstract

Cited by 10 (3 self)
 Add to MetaCart
problem with a special structure and present the specialised Power Simplex algorithm that utilises this structure efficiently. The basis can be organised as an identity matrix and a small block of nonzero coefficients. There are only a few different types of nonzero blocks, and extremely fast inversion
Reference Architecture For Holonic Manufacturing Systems  the key to support evolution and reconfiguration
, 1998
"... vi vii P...`".d...#^TM"..."fddo/oo"# f...+...~..."do/oo...~fo/ood...fdee~#f..~ .'."o/oo^TMf...#~."efdo/oo...^TMi^TMd..."..." Om succesvol te blijven moeten productiesystemen zich steeds vaker aanpassen aan nieuwe omstandigheden: nieuwe techno ..."
Abstract

Cited by 59 (2 self)
 Add to MetaCart
vi vii P...`".d...#^TM"..."fddo/oo"# f...+...~..."do/oo...~fo/ood...fdee~#f..~ .'."o/oo^TMf...#~."efdo/oo...^TMi^TMd..."..." Om succesvol te blijven moeten productiesystemen zich steeds vaker aanpassen aan nieuwe omstandigheden: nieuwe technologien, nieuwe producten, nieuwe organisatiestructuren, etc. Deze thesis ontwikkelt een referentiearchitectuur voor productiebesturing die veranderingen en herconfiguratie van het productiebesturingssysteem mogelijk maakt. Tegelijk moet de architectuur toch efficinte logistieke en technische plannings en uitvoeringsalgoritmen toelaten voor het besturen van grote en heterogene productiesystemen. Er wordt inspiratie gezocht in het paradigma van holonische productiesystemen. Naar analogie met biologische en sociale systemen, hebben ze een hirarchische structuur bestaande uit autonome en samenwerkende entiteiten of holons.
Methods for tearing systems of equations in object oriented modeling
 In ESM’94 European Simulation Multiconference
"... Modeling of continuous systems gives a set of differential and algebraic equations. In order to utilize explicit integration routines, the highest order derivatives must be solved for. In certain cases there exist algebraic loops, i.e., subsets of the equations must be solved simultaneously. The dep ..."
Abstract

Cited by 21 (6 self)
 Add to MetaCart
. The dependency structures of such subsets are often sparse. In such cases, the solution may be found more efficiently by a technique called tearing (Kron 1963) which reduces the dimensions of subsystems. This paper gives an overview of the principles of tearing. Algorithms to determine how a set of equations
Results 1  10
of
455