Results 1  10
of
220,957
RealTime Systems
, 2000
"... Collision avoidance is an important topic in multirobot systems. Existing multirobot pathfinding approaches ignore sideswipe collisions among robots (i.e., only consider the collision which two agents try to occupy the same node during the same timestep) [1, 3, 4], and allow diagonal move between ..."
Abstract

Cited by 599 (11 self)
 Add to MetaCart
Collision avoidance is an important topic in multirobot systems. Existing multirobot pathfinding approaches ignore sideswipe collisions among robots (i.e., only consider the collision which two agents try to occupy the same node during the same timestep) [1, 3, 4], and allow diagonal move
Stochastic Diagonalization
, 1998
"... In this lecture we present the theory and some results of applications of the stochastic diagonalization method. We discuss the origin of the minussign problem in Quantum Monte Carlo methods from a general perspective. Based on a random process defined through the use of orthogonal transformations, ..."
Abstract
 Add to MetaCart
In this lecture we present the theory and some results of applications of the stochastic diagonalization method. We discuss the origin of the minussign problem in Quantum Monte Carlo methods from a general perspective. Based on a random process defined through the use of orthogonal transformations
Diagonal peg solitaire
 Integers
, 2007
"... We study the classical game of peg solitaire when diagonal jumps are allowed. We prove that on many boards, one can begin from a full board with one peg missing, and finish with one peg anywhere on the board. We then consider the problem of finding solutions that minimize the number of moves (where ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
We study the classical game of peg solitaire when diagonal jumps are allowed. We prove that on many boards, one can begin from a full board with one peg missing, and finish with one peg anywhere on the board. We then consider the problem of finding solutions that minimize the number of moves (where
Representing and reformulating diagonalization methods
, 1994
"... Abstract Finding an appropriate representation of planning operators is crucial for theorem provers that work with proof planning. We show a new representation of operators and demonstrate how diagonalization can be represented by operators. We explain how a diagonalization operator used in one proo ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
Abstract Finding an appropriate representation of planning operators is crucial for theorem provers that work with proof planning. We show a new representation of operators and demonstrate how diagonalization can be represented by operators. We explain how a diagonalization operator used in one
On signed diagonal flip sequences
, 2009
"... Eliahou [1] and Kryuchkov conjectured a proposition that Gravier and Payan [4] proved to be equivalent to the Four Color Theorem. It states that any triangulation of a polygon can be transformed into another triangulation of the same polygon by a sequence of signed diagonal flips. It is well known t ..."
Abstract
 Add to MetaCart
Eliahou [1] and Kryuchkov conjectured a proposition that Gravier and Payan [4] proved to be equivalent to the Four Color Theorem. It states that any triangulation of a polygon can be transformed into another triangulation of the same polygon by a sequence of signed diagonal flips. It is well known
Diagonalization of ppwaves
, 1997
"... A coordinate transformation is found which diagonalizes the axisymmetric ppwaves. Its effect upon concrete solutions, including impulsive and shock waves, is discussed. ..."
Abstract
 Add to MetaCart
A coordinate transformation is found which diagonalizes the axisymmetric ppwaves. Its effect upon concrete solutions, including impulsive and shock waves, is discussed.
Diagonalization in Parallel Space
"... Matrix diagonalization is an important component of many aspects of computational science. There are a variety of algorithms to accomplish this task. Jacobi's algorithm is a good choice for parallel environments. Jacobi's algorithm consists of a series of matrix plane rotations, the orde ..."
Abstract
 Add to MetaCart
Matrix diagonalization is an important component of many aspects of computational science. There are a variety of algorithms to accomplish this task. Jacobi's algorithm is a good choice for parallel environments. Jacobi's algorithm consists of a series of matrix plane rotations
Results 1  10
of
220,957